具有机器可用性约束的校园规模全局计算作业调度

First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06) Pub Date : 2006-06-20 DOI:10.1109/IMSCCS.2006.82

Guangzhong Sun, Jiulong Shan, Guoliang Chen

{"title":"具有机器可用性约束的校园规模全局计算作业调度","authors":"Guangzhong Sun, Jiulong Shan, Guoliang Chen","doi":"10.1109/IMSCCS.2006.82","DOIUrl":null,"url":null,"abstract":"The rapid improvement of commodity components makes the global computing platform increasingly viable for many applications. This paper studied the problem of job scheduling for campus-scale global computing on theoretical level. Based on system modeling, we first proved the scheduling problem is a NP-hard problem, and then chose the approximation algorithm LS (list scheduling) as a solution. Finally, the theoretical analysis showed that it is a (m+1)-approximation algorithm for our model","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Job Scheduling for Campus-scale Global Computing with Machine Availability Constraints\",\"authors\":\"Guangzhong Sun, Jiulong Shan, Guoliang Chen\",\"doi\":\"10.1109/IMSCCS.2006.82\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The rapid improvement of commodity components makes the global computing platform increasingly viable for many applications. This paper studied the problem of job scheduling for campus-scale global computing on theoretical level. Based on system modeling, we first proved the scheduling problem is a NP-hard problem, and then chose the approximation algorithm LS (list scheduling) as a solution. Finally, the theoretical analysis showed that it is a (m+1)-approximation algorithm for our model\",\"PeriodicalId\":202629,\"journal\":{\"name\":\"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-06-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IMSCCS.2006.82\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMSCCS.2006.82","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

商品组件的快速改进使得全球计算平台越来越适合许多应用程序。本文从理论层面研究了校园规模全局计算的作业调度问题。在系统建模的基础上，首先证明了调度问题是一个NP-hard问题，然后选择近似算法LS (list scheduling)作为解决方案。最后，理论分析表明，该模型是一个(m+1)逼近算法

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

查看原文本刊更多论文

Job Scheduling for Campus-scale Global Computing with Machine Availability Constraints

The rapid improvement of commodity components makes the global computing platform increasingly viable for many applications. This paper studied the problem of job scheduling for campus-scale global computing on theoretical level. Based on system modeling, we first proved the scheduling problem is a NP-hard problem, and then chose the approximation algorithm LS (list scheduling) as a solution. Finally, the theoretical analysis showed that it is a (m+1)-approximation algorithm for our model

求助全文

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

来源期刊

First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)

自引率

0.00%

发文量