| VRSTA GRADIVA | analitična raven (sestavni del), tekstovno gradivo, tiskano, 1.01 - izvirni znanstveni članek |
| DRŽAVA IZIDA | Slovenija |
| LETO IZIDA | 2000 |
| JEZIK BESEDILA/IZVIRNIKA | slovenski |
| PISAVA | latinica |
| AVTOR | Brest, Janez - avtor |
| ODGOVORNOST | Žumer, Viljem - avtor |
| NASLOV | Aproksimacijski algoritem za statično razvrščanje opravil na večprocesorskem računalniku = ǂAn ǂapproximation algorithm for static task scheduling on multiprocessors |
| V PUBLIKACIJI | Elektrotehniški vestnik. - ISSN 0013-5852. -ǂLetn. ǂ67, ǂšt. ǂ2 (2000), str. 138-144. |
| KRATKA VSEBINA | In this paper we proposed a new multiprocessorscheduling algorithm, called MCP/AM, which is based on well known MCP algorithm. Both, the MCP/AM and MCP algorithms have the same complexity of ▫$O(v^2 log v)$▫, where v is the number of nodes in the task graph. Algorithm, described in this paper, does not model communication time, thatis, it assumed that the data transmissions between processors did not take any time. The MCP/AM algorithm outperforms two other algorithms (ETF and MCP) by generating similar or better solution in the term of the schedulinglenght. |
| OPOMBE | Besedilo samo v slov. // Povzetek // Bibliografija: str. 143-144 |
| PREDMETNE OZNAKE | // paralelno procesiranje // multiprocesorskisistemi // razvrščanje // algoritmi |
| UDK | 004 |