Processor assignment in heterogeneous message passing parallel architectures
Stella C. S. Porto, Daniel A. Menascé · 2002
The authors propose new scheduling algorithms for loosely coupled message passing heterogeneous multiprocessors. These algorithms are extensions to previous work on scheduling in heterogeneous environments by D.A. Menasce and V. Almeida (1992). It is assumed that parallel jobs are structured as task graphs and that tasks communicate with each other by exchanging messages at synchronization points. A Markov chain based analyzer was built to obtain parallel application execution times for each of the algorithms, and their performances are compared.>