Robust static resource allocation of DAGs in a heterogeneous multicore system

Academic Article


  • In this study, we consider an environment composed of a heterogeneous cluster of multicore-based machines used to analyze satellite data. The workload involves large data sets and is subject to a deadline constraint. Multiple applications, each represented by a directed acyclic graph (DAG), are allocated to a dedicated heterogeneous distributed computing system. Each vertex in the DAG represents a task that needs to be executed and task execution times vary substantially across machines. The goal of this research is to assign the tasks in applications to a heterogeneous multicore-based parallel system in such a way that all applications complete before a common deadline, and their completion times are robust against uncertainties in execution times. We define a measure that quantifies robustness in this environment. We design, compare, and evaluate five static resource allocation heuristics that attempt to maximize robustness. We consider six different scenarios with different ratios of computation versus communication, and loose and tight deadlines. © 2013 Elsevier Inc. All rights reserved.
  • Authors

    Digital Object Identifier (doi)

    Author List

  • Briceño LD; Smith J; Siegel HJ; Maciejewski AA; Maxwell P; Wakefield R; Al-Qawasmeh A; Chiang RC; Li J
  • Start Page

  • 1705
  • End Page

  • 1717
  • Volume

  • 73
  • Issue

  • 12