André Wendt Bounding the Minimal Completion Time Intro Splitting 2 parts Combining Classes.pdfVIP

下载本文档

1
0
约1.71万字
约 45页
2017-04-06 发布于江苏
举报
版权申诉

André Wendt Bounding the Minimal Completion Time Intro Splitting 2 parts Combining Classes.pdf

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

André Wendt Bounding the Minimal Completion Time Intro Splitting 2 parts Combining Classes

Intro Splitting 2 parts Combining Classes Conclusion Bounding the Minimal Completion Time in High Performance Parallel Processing Multiprocessor Scheduling André Wendt Hasso-Plattner-Institut für Softwaresystemtechnik May 22, 2006 André Wendt Bounding the Minimal Completion Time Intro Splitting 2 parts Combining Classes Conclusion Outline 1 Introduction 2 Splitting a program into a thick and thin part 3 Think and thin part regarded separately The thick part The thin part 4 Combining the thick and the thin section 5 Finding an optimal allocation 6 Conclusion André Wendt Bounding the Minimal Completion Time Intro Splitting 2 parts Combining Classes Conclusion Outline 1 Introduction 2 Splitting a program into a thick and thin part 3 Think and thin part regarded separately The thick part The thin part 4 Combining the thick and the thin section 5 Finding an optimal allocation 6 Conclusion André Wendt Bounding the Minimal Completion Time Intro Splitting 2 parts Combining Classes Conclusion Objectives process migration is not always supported finding the best allocation of processes to processors is NP-hard evaluation of result is important = worth-while to go on searching? best to find an upper bound on the minimal completion time André Wendt Bounding the Minimal Completion Time Intro Splitting 2 parts Combining Classes Conclusion Procedure theoretical consideration split a program into parallel (thick) and serial (thin) part calculate completion time for each part separately branch-and-bound algorithm for finding an optimal allocation reduce the search space to .0004% André Wendt Bounding the Minimal Completion Time Intro Splitting 2 parts Combining Classes Conclusion Definitions parallel program P: n processes running on k processors synchronization latency t , synch. frequency z allocation A = (a1,a2, ..,ak ) minimal completion time T (P, k , t) = minA T (P, k , t ,A) parallel profile vector V André Wendt Bounding the Minimal Completion Time Intro Splitting 2 parts Com