首页> 外文期刊>Parallel Processing Letters >BOUNDS ON THE SCALABILITY OF BAG-OF-TASKS APPLICATIONS RUNNING ON MASTER-SLAVE PLATFORMS
【24h】

BOUNDS ON THE SCALABILITY OF BAG-OF-TASKS APPLICATIONS RUNNING ON MASTER-SLAVE PLATFORMS

机译:在从属平台上运行的任务包应用程序的可扩展性的界限

获取原文
获取原文并翻译 | 示例
           

摘要

Bag-of-Tasks applications are parallel applications composed of independent (i.e., embarrassingly parallel) tasks that do not communicate with each other, may depend upon one or more input files, and can be executed in any order. Each file may be input for more than one task. A common framework to execute BoT applications is the master- slave topology, in which the user machine is used to control the execution of tasks. In this scenario, a large number of concurrent tasks competing for resources (e.g., CPU and communication links) severely limits the scalability. In this paper we studied the scalability of BoT applications running on multi-node systems (e.g. clusters and grids) organized as master-slave platforms, considering two communications paradigms: multiplexed connections and efficient broadcast. We prove that the lowest bound possible on the isoefficiency function for master-slave platforms is achievable by those platforms that have an O(1) efficient broadcast primitive available. We also analyze the impact of output file contention in scalability, under different assumptions. Our study employs a set of simulation experiments that confirms and extends the theoretical results (e.g. by simulating TCP links).
机译:任务袋应用程序是由相互独立的(即令人尴尬的并行)任务组成的并行应用程序,这些任务彼此不通信,可能依赖一个或多个输入文件,并且可以按任何顺序执行。每个文件可以输入多个任务。执行BoT应用程序的常见框架是主从拓扑,在该拓扑中,用户计算机用于控制任务的执行。在这种情况下,大量并发任务竞争资源(例如,CPU和通信链接)严重限制了可伸缩性。在本文中,我们研究了在组织为主从平台的多节点系统(例如集群和网格)上运行的BoT应用程序的可伸缩性,其中考虑了两种通信范例:多路复用连接和有效广播。我们证明,对于那些具有O(1)有效广播原语的平台,可以实现主从平台的等效率函数上的最低限度。我们还分析了在不同假设下输出文件争用对可伸缩性的影响。我们的研究采用了一组模拟实验,可以证实并扩展理论结果(例如,通过模拟TCP链接)。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号