Volume 36, Number 1, January-March 2002
|Page(s)||37 - 51|
|Published online||15 July 2002|
Scheduling multiprocessor tasks on two parallel processors
Instytut Informatyki, Politechnika Poznańska,
ul. Piotrowo 3a, 60-965 Poznań, Poland; firstname.lastname@example.org.
2 Dipartimento di Statistica, Probabilita' e Statistiche Applicate Universita' di Roma “La Sapienza", Piazzale Aldo Moro 5, 00185 Roma, Italy; and Istituto di Analisi dei Sistemi ed Informatica C.N.R., Viale Manzoni 30, 00185 Roma, Italy.
In this work scheduling multiprocessor tasks on two parallel identical processors is considered. Multiprocessor tasks can be executed by more than one processor at the same moment of time. We analyze scheduling unit execution time and preemptable tasks to minimize schedule length and maximum lateness. Cases with ready times, due-dates and precedence constraints are discussed.
Key words: Parallel processing / deterministic scheduling / multiprocessor tasks / coscheduling / gang scheduling / concurrent task systems.
© EDP Sciences, 2002
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.