arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.13974cs.DCmath.OC
收藏

志愿者计算系统中雾云资源的联合QoS-aware和成本有效的任务调度

Joint QoS-aware and Cost-efficient Task Scheduling for Fog-Cloud Resources in a Volunteer Computing System

Farooq Hoseiny, Sadoon Azizi, Mohammad Shojafar, Rahim Tafazolli

摘要:

志愿者计算是一种基于Internet的分布式计算系统,志愿者共享他们额外的可用资源来管理大规模任务。然而,志愿者计算系统(Volunteer Computing System,简称UMTS)中的计算设备在其处理能力、货币成本和数据传输延迟方面是高度动态和异构的。为了保证不同请求的高服务质量(QoS)和低成本,必须有效地利用所有可用的计算资源。任务调度是一个NP难问题,被认为是异构并行计算中的主要挑战之一。基于此,本文设计了两种面向虚拟控制系统的任务调度算法Min-CCV和Min-V。算法的主要目标是联合最小化物联网(IoT)请求的计算、通信和延迟违规成本。我们广泛的模拟结果表明,所提出的算法能够更有效地分配任务到志愿者雾/云资源比国家的最先进的。具体来说,我们的算法提高了约99.5%的最后期限满意度的任务率,并降低了15至53%之间的总成本相比,基于遗传算法。

英文摘要:

Volunteer computing is an Internet-based distributed computing system in which volunteers share their extra available resources to manage large-scale tasks. However, computing devices in a Volunteer Computing System (VCS) are highly dynamic and heterogeneous in terms of their processing power, monetary cost, and data transferring latency. To ensure both the high Quality of Service (QoS) and low cost for different requests, all of the available computing resources must be used efficiently. Task scheduling is an NP-hard problem that is considered one of the main critical challenges in a heterogeneous VCS. Due to this, in this paper, we design two task scheduling algorithms for VCSs, named Min-CCV and Min-V. The main goal of the proposed algorithms is jointly minimizing the computation, communication and delay violation cost for the Internet of Things (IoT) requests. Our extensive simulation results show that proposed algorithms are able to allocate tasks to volunteer fog/cloud resources more efficiently than the state-of-the-art. Specifically, our algorithms improve the deadline satisfaction task rates by around 99.5% and decrease the total cost between 15 to 53% in comparison with the genetic-based algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑