Extra Processors versus Future Information in Optimal Deadline Scheduling.pdfVIP

下载本文档

3
0
约 9页
2017-04-11 发布于江苏
举报
版权申诉

Extra Processors versus Future Information in Optimal Deadline Scheduling.pdf

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Extra Processors versus Future Information in Optimal Deadline Scheduling

Extra Processors versus Future Information in Optimal Deadline Scheduling Chiu-Yuen Koo ? Tak-Wah Lam ? Tsuen-Wan Ngan ? Kar-Keung To ? ABSTRACT This paper is concerned with the extra-resource analysis of online scheduling algorithms. In particular, it studies how to make use of multiple processors to counteract the lack of future information in online deadline scheduling. Our results extend the previous work which are primarily based of using a faster processor to obtain a performance guarantee. The challenge arises from the fact that jobs are sequential in nature and cannot be executed on more than one processor at the same time. Thus, a faster processor can speed up a job while multiple unit-speed processors cannot help. 1. INTRODUCTION Online algorithms for scheduling jobs with deadlines on a processor have been studied extensively in the literature. A typical example is the earliest deadline first (EDF) algo- rithm, which has been widely used in many real-time sys- tems (see [18] for a survey). From a theoretical viewpoint, EDF is optimal for scheduling underloaded systems, i.e., whenever there exists a schedule meeting the deadlines of all jobs released, EDF can always do so [6]. However, when the system is possibly overloaded, no algorithm has a worst-case performance guarantee in the sense that the performance cannot match or be competitive against the offline adver- sary [2]. In recent years, a plausible approach to studying better performance guarantee for online scheduling (without restricting the inputs) is to allow the online scheduler to use a faster processor than the offline adversary [3,5,7,10,14,16]. Intuitively, we need a faster processor to compensate the online scheduler for the lack of future information. The key question is whether a moderate amount of extra speed can ?Department of Computer Science, University of Maryland, College Park, MD 20742, USA (cykoo@cs.umd.edu). ?Department of Computer Science, University of Hong Kong, Pokfulam Road,