
Task Scheduling in Parallel and Distributed Systems
Prentice Hall (Publisher)
Published on 1. April 1994
Book
Hardback
304 pages
978-0-13-099235-2 (ISBN)
Description
El-Rewini and Lewis were among the first researchers to recognize the problem of resource allocation (scheduling) inherent in parallel and distributed programs - those which consist of interacting tasks, each capable of running on a separate processor. Without proper allocation and ordering of tasks, the parallel and distributed program will not deliver improvements beyond that of a serial program. Until now, much of the literature on this problem has been hidden in obscure research journals. This single-source reference addresses the resource allocation problem in all of its variations, and surveys the most important scheduling techniques that have been proposed over the past decade.
More details
Language
English
Place of publication
Upper Saddle River
United States
Publishing group
Pearson Education (US)
Target group
College/higher education
Dimensions
Height: 235 mm
Width: 158 mm
Thickness: 26 mm
Weight
605 gr
ISBN-13
978-0-13-099235-2 (9780130992352)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Content
1. Resource Allocation: A Classical Problem. 2. The General Model. 3. Optimal Scheduling Algorithms. 4. The Relationship Between Matching and Two-Processor Scheduling. 5. Static Scheduling Heuristics. 6. SPMD Model. 7. Dynamic Task Allocation. 8. Loop Scheduling on Shared-Memory Computers. 9. Loop Scheduling on Distributed-Memory Computers. 10. Task Partitioning and Grain Size. 11. Scheduling CASE Tools. Appendix. Index.