A comparison of the static task graph scheduling algorithms

Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001. Pub Date : 2001-06-19 DOI:10.1109/ITI.2001.937995

J. Brest, V. Zumer

引用次数: 3

Abstract

In this paper the new algorithm for static task graph scheduling on multiprocessor systems is proposed and a comparison with two algorithms known from the literature is presented. The comparison of the algorithms is made in terms of the completion times of resulting schedules using a prototype standard task graph set.

查看原文本刊更多论文

静态任务图调度算法的比较

本文提出了一种新的多处理器系统静态任务图调度算法，并与文献中已知的两种算法进行了比较。使用一个原型标准任务图集，对算法的完成时间进行了比较。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.

自引率

0.00%

发文量