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!
|
| LEADER | 01122naa a2200193 ib4500 | ||
|---|---|---|---|
| 001 | 7655446 | ||
| 003 | SI-MaCOB | ||
| 005 | 20141219000000.0 | ||
| 008 | 030127s2002 xv |||||||||||||| ||eng c | ||
| 040 | |a KTFMB |b slv |c SI-MaIIZ |e ppiak | ||
| 080 | |a 004 | ||
| 100 | 1 | |a Brest, Janez. |4 aut | |
| 245 | 0 | 0 | |a A list scheduling heuristic for allocating the task graph to multiprocessors / |c Janez Brest and Viljem Žumer. |
| 300 | |a str. 433-438. | ||
| 520 | |a 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 previous algorithms in terms of the generated schedule length using Standard Task Graph set. | ||
| 653 | 0 | |a paralelno procesiranje |a prevajalniki |a statično načrtovanje | |
| 653 | 0 | |a parallel processing |a compiler |a static scheduling | |
| 700 | 1 | 2 | |a Žumer, Viljem. |4 aut |
| 773 | 0 | |t Informatica |d Ljubljana : Slovene Society Informatika, 1977- |x 0350-5596 |g Vol. 26, no. 4 (dec. 2002), str. 433-438 | |