A list scheduling heuristic for allocating the task graph to multiprocessors /
In this paper we propose a new static scheduling algorithm for allocating the task graph without communication costs to fully connected multiprocessors. A global comparison is carried out for the proposed algorithm and three reported scheduling algorithms. The proposed algorithm outperforms the prev...
Shranjeno v:
| Main Authors: | , |
|---|---|
| Format: | Book Chapter |
| Jezik: | English |
| Teme: | |
| Sorodne knjige/članki: | Vsebovano v:
Informatica |
| Oznake: |
Označite
Brez oznak, prvi označite!
|
Vzdrževanje sistema
Trenutno vzdržujemo knjižnični informacijski sistem.
Informacije o zalogi so trenutno nedostopne. Opravičujemo se za nevšečnosti in vas prosimo da nas ponovno kontaktirate: