Task scheduling in parallel and distributed systems
著者
書誌事項
Task scheduling in parallel and distributed systems
（Prentice Hall series in innovative technology）
PTR Prentice Hall, c1994
大学図書館所蔵 件 / 全18件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references and index
内容説明・目次
内容説明
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.
目次
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.
「Nielsen BookData」 より
