平行加工系统的粒度测定

B. Kruatrachue, T. Lewis
{"title":"平行加工系统的粒度测定","authors":"B. Kruatrachue, T. Lewis","doi":"10.1109/HICSS.1988.11797","DOIUrl":null,"url":null,"abstract":"A method of parallel-program optimization called grain packing is introduced that reduces total execution time of a parallel program by balancing execution time and communication time. The new method is applicable to both extended serial and concurrent programming languages, and can be used in languages such as OCCAM, Fortran, and Pascal. It is shown by example that two misconceptions common among programmers can lead to nonoptimal use of parallel processors: (1) load balancing does not give optimal performance in all cases, and (2) explicit parallel constructions in programming languages often lead to nonoptimal partitioning of parallel programs. Grain packing, along with an optimizing scheduler, gives consistently better results than human-engineered scheduling and packing.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Grain determination for parallel processing systems\",\"authors\":\"B. Kruatrachue, T. Lewis\",\"doi\":\"10.1109/HICSS.1988.11797\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A method of parallel-program optimization called grain packing is introduced that reduces total execution time of a parallel program by balancing execution time and communication time. The new method is applicable to both extended serial and concurrent programming languages, and can be used in languages such as OCCAM, Fortran, and Pascal. It is shown by example that two misconceptions common among programmers can lead to nonoptimal use of parallel processors: (1) load balancing does not give optimal performance in all cases, and (2) explicit parallel constructions in programming languages often lead to nonoptimal partitioning of parallel programs. Grain packing, along with an optimizing scheduler, gives consistently better results than human-engineered scheduling and packing.<<ETX>>\",\"PeriodicalId\":148246,\"journal\":{\"name\":\"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HICSS.1988.11797\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HICSS.1988.11797","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

提出了一种并行程序优化的方法,即颗粒填充法,通过平衡并行程序的执行时间和通信时间来减少并行程序的总执行时间。该方法适用于扩展串行和并发编程语言,并可用于OCCAM、Fortran和Pascal等语言。示例表明,程序员中常见的两种误解可能导致并行处理器的非最佳使用:(1)负载平衡并不能在所有情况下提供最佳性能;(2)编程语言中的显式并行结构经常导致并行程序的非最佳划分。谷物包装,随着优化调度程序,提供始终比人类工程调度和包装更好的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Grain determination for parallel processing systems
A method of parallel-program optimization called grain packing is introduced that reduces total execution time of a parallel program by balancing execution time and communication time. The new method is applicable to both extended serial and concurrent programming languages, and can be used in languages such as OCCAM, Fortran, and Pascal. It is shown by example that two misconceptions common among programmers can lead to nonoptimal use of parallel processors: (1) load balancing does not give optimal performance in all cases, and (2) explicit parallel constructions in programming languages often lead to nonoptimal partitioning of parallel programs. Grain packing, along with an optimizing scheduler, gives consistently better results than human-engineered scheduling and packing.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信