Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Błażewicz et al. (2002) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: