Jupiter:一种网络化计算体系结构
Jupiter: A Networked Computing Architecture
摘要:
在物联网时代,人们对网络计算的需求越来越大,以支持时间受限、计算密集型的分布式应用,如多摄像机视频处理和数据融合等。我们提出了木星,一个开源的网络计算系统,输入有向无环图(DAG)为基础的计算任务图,有效地分配任务之间的一组网络计算节点,而不管他们的地理分离和编排执行的DAG之后。这个基于Kubernetes容器编排的系统支持集中式和分散式调度算法,用于根据来自一系列分析器的信息优化映射任务:网络分析器,资源分析器和执行时间分析器。虽然具有全局知识的集中式调度算法在网格/云计算社区中很受欢迎,但我们认为分布式调度方法更适合于网络计算,因为面对网络动态时通信和计算开销较低。为此,我们提出并实现了一类新的分布式调度算法称为WAVE的木星系统。我们提出了一组现实世界的实验在两个独立的测试平台上-一个全球网络的90个云计算机在8个城市和其他一个集群的30个树莓派节点,在一个简单的网络计算应用程序称为分布式网络异常检测器(DNAD)。我们发现,尽管使用更多的本地化知识,分布式波贪心算法可以实现类似的性能作为一个经典的集中式调度算法称为异构最早完成时间(HEFT),适当增强木星系统。
英文摘要:
In the era of Internet of Things, there is an increasing demand for networked computing to support the requirements of the time-constrained, compute-intensive distributed applications such as multi-camera video processing and data fusion for security. We present Jupiter, an open source networked computing system that inputs a Directed Acyclic Graph (DAG)-based computational task graph to efficiently distribute the tasks among a set of networked compute nodes regardless of their geographical separations and orchestrates the execution of the DAG thereafter. This Kubernetes container-orchestration-based system supports both centralized and decentralized scheduling algorithms for optimally mapping the tasks based on information from a range of profilers: network profilers, resource profilers, and execution time profilers. While centralized scheduling algorithms with global knowledge have been popular among the grid/cloud computing community, we argue that a distributed scheduling approach is better suited for networked computing due to lower communication and computation overhead in the face of network dynamics. To this end, we propose and implement a new class of distributed scheduling algorithms called WAVE on the Jupiter system. We present a set of real world experiments on two separate testbeds - one a world-wide network of 90 cloud computers across 8 cities and the other a cluster of 30 Raspberry pi nodes, over a simple networked computing application called Distributed Network Anomaly Detector (DNAD). We show that despite using more localized knowledge, a distributed WAVE greedy algorithm can achieve similar performance as a classical centralized scheduling algorithm called Heterogeneous Earliest Finish Time (HEFT), suitably enhanced for the Jupiter system.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。