On Non-Approximability of Coarse-Grained Workflow Grid Scheduling

@article{Fujimoto2008OnNO,
  title={On Non-Approximability of Coarse-Grained Workflow Grid Scheduling},
  author={Noriyuki Fujimoto},
  journal={2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)},
  year={2008},
  pages={127-132}
}
Scheduling a scientific workflow onto a computational grid is considered. A computational grid can be regarded as a heterogeneous parallel machine such that the speed of each processor varies over time. A scientific workflow can be modeled as a DAG of tasks. This paper focuses on a coarse-grained workflow. So, any communication delay between tasks is negligible because computation time of every task is much longer than the corresponding communication delay. Hence, in this paper, a coarse… CONTINUE READING