Processor assignment in heterogeneous message passing parallel architectures

Author

Porto, Stella C S ; Menascé, Daniel A.

Author_Institution

Univ. Federal Fluminense, Rio de Janeiro, Brazil

fYear

1993

Firstpage

496

Abstract

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

Keywords

Markov processes; message passing; parallel architectures; scheduling; synchronisation; Markov chain based analyzer; heterogeneous message passing parallel architectures; multiprocessors; performances; processor assignment; scheduling algorithms; synchronization; task graphs; Algorithm design and analysis; Computer architecture; Concurrent computing; Costs; Message passing; Parallel architectures; Parallel processing; Processor scheduling; Scheduling algorithm; Very large scale integration;

fLanguage

English

Publisher

ieee

Conference_Titel

System Sciences, 1993, Proceeding of the Twenty-Sixth Hawaii International Conference on

Conference_Location

Wailea, HI

Print_ISBN

0-8186-3230-5

Type

conf

DOI

10.1109/HICSS.1993.284076

Filename

284076