514 KB20 KB197720262002Brest, JanezŽumer, Viljemletnik:26številka:4str. 433-438ISSN:0350-5596COBISSID:7655446URN:URN:NBN:SI:doc-F02NA2A5enSlovensko društvo InformatikaInformatica (Ljubljana)algoritmiparalelno procesiranjeprevajalnikistatično načrtovanjeA 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 previous algorithms in terms of the generated schedule length using Standard Task Graph setTEXTznanstveno časopisjejournalsSlovenian National E-content AggregatorNational and University Library of SloveniaSlovensko društvo Informatika