I-BOT:基于干扰的动态非托管边缘计算任务调度
I-BOT: Interference-Based Orchestration of Tasks for Dynamic Unmanaged Edge Computing
摘要:
近年来,边缘计算已成为面部识别和增强现实等延迟敏感型应用的热门选择,因为与云计算相比,它更接近最终用户。尽管基础设施提供商正在努力创建受管理的边缘网络,但笔记本电脑和平板电脑等个人设备也可以用作潜在的边缘设备,这些设备广泛使用且未得到充分利用。我们将此类设备称为非托管边缘设备(UED)。在这样的非托管边缘系统上调度应用任务并不简单,这是因为三个基本原因-UE的计算能力的异构性、UE的可用性的不确定性(由于设备离开系统)以及共享UED的多个任务之间的干扰。在本文中,我们提出了I-BOT,这是一种基于干扰的编排方案,用于非托管边缘平台(UEP)上的延迟敏感任务。它最大限度地减少了应用程序的完成时间,并且具有带宽效率。I-BOT带来了三大创新。首先,它剖析和预测的任务的干扰模式,使调度决策。其次,它使用反馈机制来调整UED的计算能力的变化,并使用预测机制来处理它们的零星退出。第三,它在其调度决策中考虑任务的输入依赖性(例如,两个任务需要相同的输入数据)。为了评估I-BOT,我们使用代表自动驾驶的应用程序进行端到端模拟,这些应用程序由多个任务组成。我们比较了两个基本基线(随机和循环)和两个最先进的Lavea [SEC-2017]和Petrel [MSN-2018]。与这些基准相比,I-BOT显著减少了应用程序任务的平均服务时间。这种减少在动态异构环境中更为明显,这在UEP中就是这种情况。
英文摘要:
In recent years, edge computing has become a popular choice for latency-sensitive applications like facial recognition and augmented reality because it is closer to the end users compared to the cloud. Although infrastructure providers are working toward creating managed edge networks, personal devices such as laptops and tablets, which are widely available and are underutilized, can also be used as potential edge devices. We call such devices Unmanaged Edge Devices (UEDs). Scheduling application tasks on such an unmanaged edge system is not straightforward because of three fundamental reasons-heterogeneity in the computational capacity of the UEDs, uncertainty in the availability of the UEDs (due to devices leaving the system), and interference among multiple tasks sharing a UED. In this paper, we present I-BOT, an interference-based orchestration scheme for latency-sensitive tasks on an Unmanaged Edge Platform (UEP). It minimizes the completion time of applications and is bandwidth efficient. I-BOT brings forth three innovations. First, it profiles and predicts the interference patterns of the tasks to make scheduling decisions. Second, it uses a feedback mechanism to adjust for changes in the computational capacity of the UEDs and a prediction mechanism to handle their sporadic exits. Third, it accounts for input dependence of tasks in its scheduling decision (such as, two tasks requiring the same input data). To evaluate I-BOT, we run end-to-end simulations with applications representing autonomous driving, composed of multiple tasks. We compare to two basic baselines (random and round-robin) and two state-of-the-arts, Lavea [SEC-2017] and Petrel [MSN-2018]. Compared to these baselines, I-BOT significantly reduces the average service time of application tasks. This reduction is more pronounced in dynamic heterogeneous environments, which would be the case in a UEP.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。