Optimal Restart Times for Moments of Completion Times.pdf

Optimal Restart Times for Moments of Completion Times.pdf

  1. 1、本文档共10页,可阅读全部内容。
  2. 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Optimal Restart Times for Moments of Completion Times

Optimal Restart Times for Moments of Completion Time Aad van Moorsel1 and Katinka Wolter2 1 Go?lerstra?e 11, 12161 Berlin, Germany conferences@ 2 Humboldt-Universita?t zu Berlin, Institut fu?r Informatik, Unter den Linden 6, 10099 Berlin, Germany wolter@informatik.hu-berlin.de Abstract. Restart is an application-level technique that speeds up com- pletion for jobs with highly variable completion times. In this paper, we present an efficient iterative algorithm to determine the optimal restart strategy if there are a finite number of restarts, and if one is interested in minimising higher moments of the completion time. We demonstrate its computational efficiency in comparison with alternative algorithms. We also discuss fast approximations to determine close to optimal restart times for limiting cases. 1 Introduction The work in this paper applies to various forms of ‘restart,’ which simply implies that a task is retried after some time threshold has passed. Restart finds its application in areas ranging from randomised algorithms [2] to distributed data base queries [6], Internet agents [3] and software rejuvenation [1]. Probably the most commonly experienced restart mechanism is clicking the reload button of the web browser when a download takes too long. The basic form of restart can be conveniently modelled assuming that (1) successive downloads are statistically independent and identically distributed, and (2) new tries abort previous tries. Such model assumptions have been found realistic for Internet applications [3, 5]. Under these assumptions, we provide in this paper an efficient algorithm to determine the optimal time instances at which to initiate restarts, so that higher moments of completion time are minimised. As we showed in [4], the optimal restart strategy for unbounded number of restarts can be determined in straightforward manner, as can that for a finite number of restarts and the first moment. However, the combination of higher moments and fin

文档评论(0)

l215322 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档