Computational & Technology Resources
an online resource for computational,
engineering & technology publications
Civil-Comp Proceedings
ISSN 1759-3433
CCP: 20
Edited by: B.H.V. Topping and M. Papadrakakis
Paper II.6

Performance Comparison of Two Scheduling Algorithms for Parallel Architectures

M. Razaz and K.A. Marlow

School of Information Systems, University of East Anglia, Norwich, United Kingdom

Full Bibliographic Reference for this paper
M. Razaz, K.A. Marlow, "Performance Comparison of Two Scheduling Algorithms for Parallel Architectures", in B.H.V. Topping, M. Papadrakakis, (Editors), "Advances in Parallel and Vector Processing for Structural Mechanics", Civil-Comp Press, Edinburgh, UK, pp 59-68, 1994. doi:10.4203/ccp.20.2.6
Two static scheduling approaches suitable for the structured implementation of signal processing algorithms onto multiprocessor hardware platforms are presented. The first is a new scheduling algorithm based on the concept of game tree techniques and the second approach is based on the extensively modified and improved Hu's algorithm. Both approaches have been successfully applied to a number of practical problems. We present here results from the application of our scheduling algorithms to two examples from the literature, and then compare and assess their performance with specific reference to mapping a complex modem system. The game tree algorithm was found to be very flexible while the modified Hu's algorithm was computationally more efficient.

purchase the full-text of this paper (price £20)

go to the previous paper
go to the next paper
return to the table of contents
return to the book description