Adaptive Speculation for Efficient Internetware Application Execution in Clouds

Author:

Ouyang Xue1,Garraghan Peter2,Primas Bernhard3,Mckee David3,Townend Paul3,Xu Jie3

Affiliation:

1. University of Leeds, and National University of Defense Technology, China

2. Lancaster University, UK

3. University of Leeds, UK

Abstract

Modern Cloud computing systems are massive in scale, featuring environments that can execute highly dynamic Internetware applications with huge numbers of interacting tasks. This has led to a substantial challenge—the straggler problem, whereby a small subset of slow tasks significantly impede parallel job completion. This problem results in longer service responses, degraded system performance, and late timing failures that can easily threaten Quality of Service (QoS) compliance. Speculative execution (or speculation) is the prominent method deployed in Clouds to tolerate stragglers by creating task replicas at runtime. The method detects stragglers by specifying a predefined threshold to calculate the difference between individual tasks and the average task progression within a job. However, such a static threshold debilitates speculation effectiveness as it fails to capture the intrinsic diversity of timing constraints in Internetware applications, as well as dynamic environmental factors, such as resource utilization. By considering such characteristics, different levels of strictness for replica creation can be imposed to adaptively achieve specified levels of QoS for different applications. In this article, we present an algorithm to improve the execution efficiency of Internetware applications by dynamically calculating the straggler threshold, considering key parameters including job QoS timing constraints, task execution progress, and optimal system resource utilization. We implement this dynamic straggler threshold into the YARN architecture to evaluate it’s effectiveness against existing state-of-the-art solutions. Results demonstrate that the proposed approach is capable of reducing parallel job response time by up to 20% compared to the static threshold, as well as a higher speculation success rate, achieving up to 66.67% against 16.67% in comparison to the static method.

Funder

University of Leeds and CSC joint scholarship program

China National Key Research and Development Program

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Networks and Communications

Reference42 articles.

1. Basic concepts and taxonomy of dependable and secure computing

2. G. E. Blelloch L. Dagum S. J. Smith K. Thearling and M. Zagha. 1993. An evaluation of sorting as a supercomputer benchmark. Int. J. High Speed Comput. (1993). G. E. Blelloch L. Dagum S. J. Smith K. Thearling and M. Zagha. 1993. An evaluation of sorting as a supercomputer benchmark. Int. J. High Speed Comput. (1993).

3. Cloud computing and emerging IT platforms: Vision, hype, and reality for delivering computing as the 5th utility

Cited by 10 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3