首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Algorithms for Integrated Routing and Scheduling for Aggregating Data from Distributed Resources on a Lambda Grid
【24h】

Algorithms for Integrated Routing and Scheduling for Aggregating Data from Distributed Resources on a Lambda Grid

机译:Lambda网格上的集成路由和调度算法,用于聚合来自分布式资源的数据

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

摘要

In many e-science applications, there exists an important need to aggregate information from data repositories distributed around the world. In an effort to better link these resources in a unified manner, many lambda-grid networks, which provide end-to-end dedicated optical circuit-switched connections, have been investigated. In this context, we consider the problem of aggregating files from distributed databases at a (grid) computing node over a lambda grid. The challenge is (i) to identify routes (i.e., circuits) in the lambda-grid network along which files should be transmitted and (ii) to schedule the transfers of these files over their respective circuits. To address this challenge, we propose a hybrid approach that combines off-line and on-line scheduling. We define the Time-Path Scheduling Problem (TPSP) for off-line scheduling. We prove that TPSP is NP-complete, develop a Mixed Integer Linear Program (MILP) formulation for TPSP, and then propose a greedy approach to solve TPSP because the MILP does not scale well. We compare the erformance of the greedy approach on a few representative lambda-grid network topologies. One key input to the off-line schedule is the file transfer time. Due to dynamics at the receiving end host which is hard to model precisely, the actual file transfer time may vary. We first propose a model for the estimating the file transfer time. Then, we propose on-line reconfiguration algorithms, so that, as files are transferred, the off-line schedule may be modified on-line depending on the amount of time that it actually took to transfer the file. This helps to reduce the total time to transfer all the files, which is an important metric. To demonstrate the effectiveness of our approach, we present results on an emulated lambda-grid network testbed.
机译:在许多电子科学应用中,非常需要从分布在世界各地的数据存储库中聚合信息。为了更好地以统一的方式链接这些资源,已经研究了许多提供端到端专用光电路交换连接的λ网格网络。在这种情况下,我们考虑在lambda网格上的(网格)计算节点上聚集来自分布式数据库的文件的问题。面临的挑战是(i)在lambda网格网络中标识应沿其传输文件的路由(即电路),以及(ii)安排这些文件在各自电路上的传输。为了应对这一挑战,我们提出了一种混合方法,将离线和在线调度相结合。我们为离线调度定义时间路径调度问题(TPSP)。我们证明TPSP是NP完全的,为TPSP开发了混合整数线性程序(MILP)公式,然后提出了一种贪婪的方法来解决TPSP,因为MILP不能很好地扩展。我们比较了贪婪方法在一些代表性的lambda-grid网络拓扑上的性能。离线计划的一个关键输入是文件传输时间。由于难以精确建模的接收端主机的动态情况,实际文件传输时间可能会有所不同。我们首先提出一个用于估计文件传输时间的模型。然后,我们提出在线重新配置算法,以便在传输文件时,可以根据传输文件实际花费的时间在线修改脱机计划。这有助于减少传输所有文件的总时间,这是一项重要指标。为了证明我们方法的有效性,我们在仿真的lambda-grid网络测试平台上展示了​​结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号