Scalable Task Deployment System Inspired from Virus Propagation Models for Large Distributed Workflow Based Systems

Mihai Bica, D. Gorgan
{"title":"Scalable Task Deployment System Inspired from Virus Propagation Models for Large Distributed Workflow Based Systems","authors":"Mihai Bica, D. Gorgan","doi":"10.1109/SYNASC.2018.00037","DOIUrl":null,"url":null,"abstract":"Deploying, executing and managing large task based workflows on cloud or distributed systems can be challenging. This paper proposes a solution for deploying and launching task based applications on large scale distributed systems. Scaling the existing systems to hundreds of thousands or million of nodes add significant overhead and in some cases will slow down the scalable systems below Amdahl's law because of the cost of managing so many nodes. The proposed solution for task deployment is inspired from computer virus models and realizes the deployment in an exponential fashion by starting with a single container that self divides until it populates all nodes in the datacenter. The architectural model is having the structural shape of binary tree, task metadata messages are routed on the tree model, longest message travel distance is at most log2(n). We compare two solutions for large task deployment and execution. A classical solution of using a linear method for deployment is compared with the computer virus inspired propagation model. Experimental results confirm that this solution is suitable for task based applications that can scale to few millions of worker nodes. Sending messages from the master node to worker nodes should not be a problem according to our simulation.","PeriodicalId":273805,"journal":{"name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2018.00037","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Deploying, executing and managing large task based workflows on cloud or distributed systems can be challenging. This paper proposes a solution for deploying and launching task based applications on large scale distributed systems. Scaling the existing systems to hundreds of thousands or million of nodes add significant overhead and in some cases will slow down the scalable systems below Amdahl's law because of the cost of managing so many nodes. The proposed solution for task deployment is inspired from computer virus models and realizes the deployment in an exponential fashion by starting with a single container that self divides until it populates all nodes in the datacenter. The architectural model is having the structural shape of binary tree, task metadata messages are routed on the tree model, longest message travel distance is at most log2(n). We compare two solutions for large task deployment and execution. A classical solution of using a linear method for deployment is compared with the computer virus inspired propagation model. Experimental results confirm that this solution is suitable for task based applications that can scale to few millions of worker nodes. Sending messages from the master node to worker nodes should not be a problem according to our simulation.
基于大型分布式工作流系统的病毒传播模型启发的可扩展任务部署系统
在云或分布式系统上部署、执行和管理基于大型任务的工作流可能具有挑战性。本文提出了一种在大规模分布式系统上部署和启动基于任务的应用程序的解决方案。将现有系统扩展到数十万或数百万个节点会增加显著的开销,并且在某些情况下,由于管理如此多节点的成本,会降低低于Amdahl定律的可扩展系统的速度。提出的任务部署解决方案的灵感来自计算机病毒模型,并通过从一个自分裂的容器开始,直到它填充数据中心的所有节点,以指数方式实现部署。该体系结构模型具有二叉树的结构形状,任务元数据消息在树模型上路由,最长消息传播距离不超过log2(n)。我们比较了两种用于大型任务部署和执行的解决方案。将采用线性方法进行部署的经典解与计算机病毒传播模型进行了比较。实验结果证实,该解决方案适用于可扩展到数百万工作节点的基于任务的应用程序。根据我们的模拟,从主节点向工作节点发送消息应该不是问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信