具有有界迁移的同机在线调度

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI:10.1109/SYNASC.2013.54

Thorsten Ehlers, K. Jansen

{"title":"具有有界迁移的同机在线调度","authors":"Thorsten Ehlers, K. Jansen","doi":"10.1109/SYNASC.2013.54","DOIUrl":null,"url":null,"abstract":"We present a robust EPTAS for scheduling on identical machines. The running time for adding one job is bounded by 2O((1/ε2) log3(1/ε)). The migration factor required to gain a (1+ ε)-approximate schedule in each iteration is bounded by 2O((1/ε) log2(1/ε)).","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"77 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Online-Scheduling on Identical Machines with Bounded Migration\",\"authors\":\"Thorsten Ehlers, K. Jansen\",\"doi\":\"10.1109/SYNASC.2013.54\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a robust EPTAS for scheduling on identical machines. The running time for adding one job is bounded by 2O((1/ε2) log3(1/ε)). The migration factor required to gain a (1+ ε)-approximate schedule in each iteration is bounded by 2O((1/ε) log2(1/ε)).\",\"PeriodicalId\":293085,\"journal\":{\"name\":\"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing\",\"volume\":\"77 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC.2013.54\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2013.54","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

我们提出了一个鲁棒的EPTAS在相同机器上的调度。添加一个作业的运行时间限定为2O((1/ε2) log3(1/ε))。在每次迭代中获得(1+ ε)近似调度所需的迁移因子被限定为2O((1/ε) log2(1/ε))。

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

查看原文本刊更多论文

Online-Scheduling on Identical Machines with Bounded Migration

We present a robust EPTAS for scheduling on identical machines. The running time for adding one job is bounded by 2^O((1/ε2) log^3(1/ε)). The migration factor required to gain a (1+ ε)-approximate schedule in each iteration is bounded by 2^{O((1/ε) log2(1/ε))}.

求助全文

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

来源期刊

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

自引率

0.00%

发文量