返回
Extending IC-scheduling via the Sweep Algorithm
DOI:10.1016/j.jpdc.2009.11.001.png)
摘要
En 中文
A key challenge when scheduling computations over the Internet is temporal unpredictability: remote workers arrive and depart at unpredictable times and often provide unpredictable computational resources; the time for communication over the Internet is impossible to predict accurately. In response, earlier research has developed the underpinnings of a theory of how to schedule computations having intertask dependencies in a way that renders tasks eligible for execution at the maximum possible rate. Simulation studies suggest that such scheduling: (a) utilizes resource providers' computational resources well, by enhancing the likelihood of having work to allocate to an available client; (b) lessens the likelihood of a computation's stalling for lack of tasks that are eligible for execution. The applicability of the current version of the theory is limited by its demands on the structure of the DAG that models the computation being scheduled-namely, that the DAG be decomposable into connected bipartite building-block DAGS. The current paper extends the theory by developing the Sweep Algorithm, which takes a significant step toward removing this restriction. The resulting augmented suite of scheduling algorithms allows one to craft optimal schedules for a large range of DAGS that the earlier framework could not handle. Most of the newly optimally scheduled DAGS presented here are artificial but close in structure to DAGS that arise in real computations; one of the new DAGS is a component of a large DAG that arises in a functional Magnetic Resonance Imaging application. (C) 2009 Elsevier Inc. All rights reserved.
Keyword:
IC-scheduling
IC-scheduling theory
Internet-based computing
Grid computing
Global computing
Scheduling DAGS
Theory
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K

