Abstract
Contrary to the scheduling problems discussed thus far, where each job (or task) is processed by at most one machine (processor) at a time, in a system with multiprocessor tasks(MPT) tasks require one or more processors at a time.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Brucker, P. (1995). Multiprocessor Tasks. In: Scheduling Algorithms. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03088-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-662-03088-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-03090-5
Online ISBN: 978-3-662-03088-2
eBook Packages: Springer Book Archive