On-Line Cost-Aware Workflow Allocation in Heterogeneous Computing Environments

Incheon Paik, Yuji Ishizuka, Quang-Minh Do, Wuhui Chen
{"title":"On-Line Cost-Aware Workflow Allocation in Heterogeneous Computing Environments","authors":"Incheon Paik, Yuji Ishizuka, Quang-Minh Do, Wuhui Chen","doi":"10.1109/MCSoC2018.2018.00042","DOIUrl":null,"url":null,"abstract":"With the appearance of on-line big data stream computation, the explosive growth of mobile devices, the development of broadband cellular network, and widespread use of WiFi in recent years, the VM allocation problem has shifted gradually from batch processing to real-time processing. As the processing streaming workflow allocation becomes very large, it has become far more difficult. First, in this paper, we have modeled new network based on mobile cloud computing and mobile edge computing scheme for the real-time streaming workflow allocation problem. Our proposed network called Heterogeneous Node Network (HNN) consists of three types of computing node. HNN has a conventional data center (DC), a cloudlet (CL) located between edge server (ES) and DC, and ES consisting of mobile devices. In HNN, DC is the conventional placement destination of virtual machine (VM) and has high computing resource compared to other nodes; CL is a new computing resource, whose performance is lower than DC, but data transmission between CL and ES is faster than between DC and ES, and ES is a cluster of mobile devices with the lowest computing resource and its advantage is reducing the amount of data from raw data for crucial processes of streaming workflow. Second, we propose a heuristic streaming workflow allocation algorithm, which is flexible according to change of real-time availability for streaming workflow and HNN environment to achieve cost minimization. Our algorithm is the hybrid of a bin-packing algorithm and a shortest path algorithm based on the VM placement problem and the shortest path problem in graph network respectively. Finally, our developed algorithm has been compared with the result of linear programming (LP). In performance evaluation, the experimental results show our approach leads to a solution close to an optimal solution generated by LP and its execution time is reduced.","PeriodicalId":413836,"journal":{"name":"2018 IEEE 12th International Symposium on Embedded Multicore/Many-core Systems-on-Chip (MCSoC)","volume":"25 19","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 12th International Symposium on Embedded Multicore/Many-core Systems-on-Chip (MCSoC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MCSoC2018.2018.00042","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

With the appearance of on-line big data stream computation, the explosive growth of mobile devices, the development of broadband cellular network, and widespread use of WiFi in recent years, the VM allocation problem has shifted gradually from batch processing to real-time processing. As the processing streaming workflow allocation becomes very large, it has become far more difficult. First, in this paper, we have modeled new network based on mobile cloud computing and mobile edge computing scheme for the real-time streaming workflow allocation problem. Our proposed network called Heterogeneous Node Network (HNN) consists of three types of computing node. HNN has a conventional data center (DC), a cloudlet (CL) located between edge server (ES) and DC, and ES consisting of mobile devices. In HNN, DC is the conventional placement destination of virtual machine (VM) and has high computing resource compared to other nodes; CL is a new computing resource, whose performance is lower than DC, but data transmission between CL and ES is faster than between DC and ES, and ES is a cluster of mobile devices with the lowest computing resource and its advantage is reducing the amount of data from raw data for crucial processes of streaming workflow. Second, we propose a heuristic streaming workflow allocation algorithm, which is flexible according to change of real-time availability for streaming workflow and HNN environment to achieve cost minimization. Our algorithm is the hybrid of a bin-packing algorithm and a shortest path algorithm based on the VM placement problem and the shortest path problem in graph network respectively. Finally, our developed algorithm has been compared with the result of linear programming (LP). In performance evaluation, the experimental results show our approach leads to a solution close to an optimal solution generated by LP and its execution time is reduced.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
异构计算环境下在线成本感知工作流分配
随着近年来在线大数据流计算的出现、移动设备的爆炸式增长、宽带蜂窝网络的发展以及WiFi的广泛使用,虚拟机分配问题逐渐从批处理转向实时处理。随着处理流工作流的分配越来越大,处理流工作流的难度也越来越大。首先,本文针对实时流工作流分配问题,建立了基于移动云计算和移动边缘计算的新型网络模型。我们提出的异构节点网络(HNN)由三种类型的计算节点组成。HNN有一个传统的数据中心(DC),一个位于边缘服务器(ES)和数据中心之间的云(CL),以及一个由移动设备组成的ES。在HNN中,数据中心是虚拟机(VM)的常规放置目的地,相对于其他节点具有较高的计算资源;CL是一种新的计算资源,其性能低于DC,但CL和ES之间的数据传输速度比DC和ES之间快,而ES是一种计算资源最少的移动设备集群,其优势在于减少了流工作流关键流程的原始数据量。其次,我们提出了一种启发式流工作流分配算法,该算法可以根据流工作流实时可用性的变化和HNN环境的变化灵活地实现成本最小化。该算法是基于虚拟机放置问题和基于图网络中最短路径问题的装箱算法和最短路径算法的混合。最后,将该算法与线性规划(LP)的结果进行了比较。在性能评估方面,实验结果表明,我们的方法得到的解接近LP生成的最优解,并且减少了执行时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Design and Evaluation of a Configurable Hardware Merge Sorter for Various Output Records On-Line Cost-Aware Workflow Allocation in Heterogeneous Computing Environments Simplified Quadcopter Simulation Model for Spike-Based Hardware PID Controller using SystemC-AMS Search Space Reduction for Parameter Tuning of a Tsunami Simulation on the Intel Knights Landing Processor Unifying Wire and Time Scheduling for Highlevel Synthesis
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1