具有任务大小限制的异构计算机网络的实际性能模型的数据划分

骈文研究 Pub Date : 2004-07-05 DOI:10.1109/ISPDC.2004.17

Alexey L. Lastovetsky, Ravi Reddy

{"title":"具有任务大小限制的异构计算机网络的实际性能模型的数据划分","authors":"Alexey L. Lastovetsky, Ravi Reddy","doi":"10.1109/ISPDC.2004.17","DOIUrl":null,"url":null,"abstract":"The paper presents a performance model that can be used to optimally schedule arbitrary tasks on a network of heterogeneous computers when there is an upper bound on the size of the task that can be solved by each computer. We formulate a problem of partitioning of an n-element set over p heterogeneous processors using this advanced performance model and give its efficient solution of the complexity O(p/sup 3/ /spl times/ log/sub 2/ n).","PeriodicalId":62714,"journal":{"name":"骈文研究","volume":"19 1","pages":"133-140"},"PeriodicalIF":0.0000,"publicationDate":"2004-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Data partitioning with a realistic performance model of networks of heterogeneous computers with task size limits\",\"authors\":\"Alexey L. Lastovetsky, Ravi Reddy\",\"doi\":\"10.1109/ISPDC.2004.17\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper presents a performance model that can be used to optimally schedule arbitrary tasks on a network of heterogeneous computers when there is an upper bound on the size of the task that can be solved by each computer. We formulate a problem of partitioning of an n-element set over p heterogeneous processors using this advanced performance model and give its efficient solution of the complexity O(p/sup 3/ /spl times/ log/sub 2/ n).\",\"PeriodicalId\":62714,\"journal\":{\"name\":\"骈文研究\",\"volume\":\"19 1\",\"pages\":\"133-140\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-07-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"骈文研究\",\"FirstCategoryId\":\"1092\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPDC.2004.17\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"骈文研究","FirstCategoryId":"1092","ListUrlMain":"https://doi.org/10.1109/ISPDC.2004.17","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 16

摘要

本文提出了一个性能模型，该模型可用于在异构计算机网络中，当每台计算机可解决的任务大小存在上界时，对任意任务进行最优调度。我们利用这一先进的性能模型构造了一个n元素集在p个异构处理器上的划分问题，并给出了复杂度为O(p/sup 3/ / sp1乘以/ log/sub 2/ n)的有效解。

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

查看原文本刊更多论文

Data partitioning with a realistic performance model of networks of heterogeneous computers with task size limits

The paper presents a performance model that can be used to optimally schedule arbitrary tasks on a network of heterogeneous computers when there is an upper bound on the size of the task that can be solved by each computer. We formulate a problem of partitioning of an n-element set over p heterogeneous processors using this advanced performance model and give its efficient solution of the complexity O(p/sup 3/ /spl times/ log/sub 2/ n).

求助全文

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

来源期刊

骈文研究

自引率

0.00%

发文量

104