Task scheduling for parallel systems
Long a tool of programmers and developers, task scheduling for parallel systems has grown legs of its own and now often resembles a magpie's nest of heuristics, models and methods. Here Sinnen (electrical and computer engineering, U. of Auckland) goes beyond the classical (read "quagmire&q...
שמור ב:
| מחבר ראשי: | |
|---|---|
| פורמט: | ספר |
| שפה: | Undetermined |
| יצא לאור: |
Hoboken, N.J.
Wiley-Interscience
2007
|
| נושאים: | |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|
| Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Cần Thơ |
|---|
| סיכום: | Long a tool of programmers and developers, task scheduling for parallel systems has grown legs of its own and now often resembles a magpie's nest of heuristics, models and methods. Here Sinnen (electrical and computer engineering, U. of Auckland) goes beyond the classical (read "quagmire" approach and shirks resorting to mere tips and tricks to present a consistent theoretical framework with realistic parallel system models that take into consideration heterogeneity, competition for communication resources and the involvement of the processor in communications. He covers parallel systems and programming, graph representations, task scheduling, fundamental heuristics, communications contentions in scheduling and processor involvement in communication. |
|---|