增加对并行程序总执行时间的分析

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN) Pub Date : 1994-12-14 DOI:10.1109/ISPAN.1994.367175

Dingchao Li, Hiromitsu Takagi, N. Ishii

{"title":"增加对并行程序总执行时间的分析","authors":"Dingchao Li, Hiromitsu Takagi, N. Ishii","doi":"10.1109/ISPAN.1994.367175","DOIUrl":null,"url":null,"abstract":"Lower bound on the finishing time of optimal schedules is used as an absolute performance measure of static scheduling heuristics. This paper presents an efficient method of computing such a bound based on estimating overlaps among the execution ranges of tasks in a given task graph and analyzing the delays of tasks on the critical paths of the graph. The computation performed by this method is shown to be of higher quality than that of other known methods. The future work and directions on this topic are also indicated.<<ETX>>","PeriodicalId":142405,"journal":{"name":"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)","volume":"34 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Increase analysis in the total execution time of a parallel program\",\"authors\":\"Dingchao Li, Hiromitsu Takagi, N. Ishii\",\"doi\":\"10.1109/ISPAN.1994.367175\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Lower bound on the finishing time of optimal schedules is used as an absolute performance measure of static scheduling heuristics. This paper presents an efficient method of computing such a bound based on estimating overlaps among the execution ranges of tasks in a given task graph and analyzing the delays of tasks on the critical paths of the graph. The computation performed by this method is shown to be of higher quality than that of other known methods. The future work and directions on this topic are also indicated.<<ETX>>\",\"PeriodicalId\":142405,\"journal\":{\"name\":\"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)\",\"volume\":\"34 4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-12-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPAN.1994.367175\",\"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 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPAN.1994.367175","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

采用最优调度完成时间的下界作为静态调度启发式的绝对性能度量。本文在估计给定任务图中任务执行范围的重叠和分析任务在图的关键路径上的延迟的基础上，提出了一种计算任务边界的有效方法。与其他已知方法相比，该方法的计算质量更高。并指出了今后的工作和研究方向

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

查看原文本刊更多论文

Increase analysis in the total execution time of a parallel program

Lower bound on the finishing time of optimal schedules is used as an absolute performance measure of static scheduling heuristics. This paper presents an efficient method of computing such a bound based on estimating overlaps among the execution ranges of tasks in a given task graph and analyzing the delays of tasks on the critical paths of the graph. The computation performed by this method is shown to be of higher quality than that of other known methods. The future work and directions on this topic are also indicated.<>

求助全文

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

来源期刊

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)

自引率

0.00%

发文量