Xiaolin Fang, Junzhou Luo, Hong Gao, Weiwei Wu, Yingshu Li
{"title":"Scheduling multi-task jobs with extra utility in data centers.","authors":"Xiaolin Fang, Junzhou Luo, Hong Gao, Weiwei Wu, Yingshu Li","doi":"10.1186/s13638-017-0986-0","DOIUrl":null,"url":null,"abstract":"<p><p>This paper investigates the problem of maximizing utility for job scheduling where each job consists of multiple tasks, each task has utility and each job also has extra utility if all tasks of that job are completed. We provide a 2-approximation algorithm for the single-machine case and a 2-approximation algorithm for the multi-machine problem. Both algorithms include two steps. The first step employs the Earliest Deadline First method to compute utility with only extra job utility, and it is proved that it obtains the optimal result for this sub-problem. The second step employs a Dynamic Programming method to compute utility without extra job utility, and it also derives the optimal result. An approximation result can then be obtained by combining the results of the two steps.</p>","PeriodicalId":12040,"journal":{"name":"EURASIP Journal on Wireless Communications and Networking","volume":"2017 1","pages":"200"},"PeriodicalIF":2.3000,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13638-017-0986-0","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"EURASIP Journal on Wireless Communications and Networking","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1186/s13638-017-0986-0","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2017/11/25 0:00:00","PubModel":"Epub","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 3
Abstract
This paper investigates the problem of maximizing utility for job scheduling where each job consists of multiple tasks, each task has utility and each job also has extra utility if all tasks of that job are completed. We provide a 2-approximation algorithm for the single-machine case and a 2-approximation algorithm for the multi-machine problem. Both algorithms include two steps. The first step employs the Earliest Deadline First method to compute utility with only extra job utility, and it is proved that it obtains the optimal result for this sub-problem. The second step employs a Dynamic Programming method to compute utility without extra job utility, and it also derives the optimal result. An approximation result can then be obtained by combining the results of the two steps.
期刊介绍：
The overall aim of the EURASIP Journal on Wireless Communications and Networking (EURASIP JWCN) is to bring together science and applications of wireless communications and networking technologies with emphasis on signal processing techniques and tools. It is directed at both practicing engineers and academic researchers. EURASIP Journal on Wireless Communications and Networking will highlight the continued growth and new challenges in wireless technology, for both application development and basic research. Articles should emphasize original results relating to the theory and/or applications of wireless communications and networking. Review articles, especially those emphasizing multidisciplinary views of communications and networking, are also welcome. EURASIP Journal on Wireless Communications and Networking employs a paperless, electronic submission and evaluation system to promote a rapid turnaround in the peer-review process.
The journal is an Open Access journal since 2004.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
