在异构临时网格环境中具有多个版本的子任务的映射

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

Sameer Shivle, H. Siegel, A. A. Maciejewski, Tarun Banka, Kiran Chindam, S. Dussinger, Andrew Kutruff, Prashanth Penumarthy, Prakash Pichumani, Praveen Satyasekaran, David Sendek, J. Sousa, J. Sridharan, Prasanna Sugavanam, J. Velazco

{"title":"在异构临时网格环境中具有多个版本的子任务的映射","authors":"Sameer Shivle, H. Siegel, A. A. Maciejewski, Tarun Banka, Kiran Chindam, S. Dussinger, Andrew Kutruff, Prashanth Penumarthy, Prakash Pichumani, Praveen Satyasekaran, David Sendek, J. Sousa, J. Sridharan, Prasanna Sugavanam, J. Velazco","doi":"10.1109/ISPDC.2004.34","DOIUrl":null,"url":null,"abstract":"An ad hoc grid is a heterogeneous computing system composed of mobile devices. The problem studied here is to statically assign resources to the subtasks of an application, which has an execution time constraint, when the resources are oversubscribed. Each subtask has a preferred version, and a secondary version that uses fewer resources. The goal is to assign resources so that the application meets its execution time constraint while minimizing the number of secondary versions used. Five resource allocation heuristics to derive near-optimal solutions to this problem are presented and evaluated.","PeriodicalId":62714,"journal":{"name":"骈文研究","volume":"174 1","pages":"380-387"},"PeriodicalIF":0.0000,"publicationDate":"2004-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Mapping of subtasks with multiple versions in a heterogeneous ad hoc grid environment\",\"authors\":\"Sameer Shivle, H. Siegel, A. A. Maciejewski, Tarun Banka, Kiran Chindam, S. Dussinger, Andrew Kutruff, Prashanth Penumarthy, Prakash Pichumani, Praveen Satyasekaran, David Sendek, J. Sousa, J. Sridharan, Prasanna Sugavanam, J. Velazco\",\"doi\":\"10.1109/ISPDC.2004.34\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An ad hoc grid is a heterogeneous computing system composed of mobile devices. The problem studied here is to statically assign resources to the subtasks of an application, which has an execution time constraint, when the resources are oversubscribed. Each subtask has a preferred version, and a secondary version that uses fewer resources. The goal is to assign resources so that the application meets its execution time constraint while minimizing the number of secondary versions used. Five resource allocation heuristics to derive near-optimal solutions to this problem are presented and evaluated.\",\"PeriodicalId\":62714,\"journal\":{\"name\":\"骈文研究\",\"volume\":\"174 1\",\"pages\":\"380-387\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-07-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"骈文研究\",\"FirstCategoryId\":\"1092\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPDC.2004.34\",\"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.34","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 17

摘要

自组织网格是由移动设备组成的异构计算系统。这里研究的问题是，当资源被超额订阅时，将资源静态地分配给具有执行时间约束的应用程序的子任务。每个子任务都有一个首选版本，以及一个使用较少资源的辅助版本。目标是分配资源，以便应用程序满足其执行时间约束，同时最小化所使用的辅助版本的数量。提出并评估了五种资源分配启发式方法，以获得该问题的近最优解。

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

查看原文本刊更多论文

Mapping of subtasks with multiple versions in a heterogeneous ad hoc grid environment

An ad hoc grid is a heterogeneous computing system composed of mobile devices. The problem studied here is to statically assign resources to the subtasks of an application, which has an execution time constraint, when the resources are oversubscribed. Each subtask has a preferred version, and a secondary version that uses fewer resources. The goal is to assign resources so that the application meets its execution time constraint while minimizing the number of secondary versions used. Five resource allocation heuristics to derive near-optimal solutions to this problem are presented and evaluated.

求助全文

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

来源期刊

骈文研究

自引率

0.00%

发文量

104