RAIRO - Operations Research
- RAIRO - Operations Research January 2002, 36 : pp 37-51
- © EDP Sciences, 2002
- DOI: http://dx.doi.org/10.1051/ro:2002004 (About DOI)
- Published online by Cambridge University Press: 21 March 2011
Research Article
Scheduling multiprocessor tasks on two parallel processors
Błażewicz, Jaceka1, Dell'Olmo, Paoloa2 and Drozdowski, Macieja1
a1 Instytut Informatyki, Politechnika Poznańska, ul. Piotrowo 3a, 60-965 Poznań, Poland; blazewic@sol.put.poznan.pl.
a2 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.
Abstract
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.
(Received November 2000)
(Online publication July 15 2002)
Key Words:
- Parallel processing;
- deterministic scheduling;
- multiprocessor tasks;
- coscheduling;
- gang scheduling;
- concurrent task systems.
