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

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

{"title":"静态任务图调度算法的比较","authors":"J. Brest, V. Zumer","doi":"10.1109/ITI.2001.937995","DOIUrl":null,"url":null,"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.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A comparison of the static task graph scheduling algorithms\",\"authors\":\"J. Brest, V. Zumer\",\"doi\":\"10.1109/ITI.2001.937995\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":375405,\"journal\":{\"name\":\"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITI.2001.937995\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITI.2001.937995","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

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

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

查看原文本刊更多论文

A comparison of the static task graph scheduling algorithms

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

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

自引率

0.00%

发文量