Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment

Academic Article


  • In a distributed heterogeneous computing system, the resources have different capabilities and tasks have different requirements. To maximize the performance of the system, it is essential to assign the resources to tasks (match) and order the execution of tasks on each resource (schedule) to exploit the heterogeneity of the resources and tasks. Dynamic mapping (defined as matching and scheduling) is performed when the arrival of tasks is not known a priori. In the heterogeneous environment considered in this study, tasks arrive randomly, tasks are independent (i.e., no inter-task communication), and tasks have priorities and multiple soft deadlines. The value of a task is calculated based on the priority of the task and the completion time of the task with respect to its deadlines. The goal of a dynamic mapping heuristic in this research is to maximize the value accrued of completed tasks in a given interval of time. This research proposes, evaluates, and compares eight dynamic mapping heuristics. Two static mapping schemes (all arrival information of tasks are known) are designed also for comparison. The performance of the best heuristics is 84% of a calculated upper bound for the scenarios considered. © 2006 Elsevier Inc. All rights reserved.
  • Authors

    Digital Object Identifier (doi)

    Author List

  • Kim JK; Shivle S; Siegel HJ; Maciejewski AA; Braun TD; Schneider M; Tideman S; Chitta R; Dilmaghani RB; Joshi R
  • Start Page

  • 154
  • End Page

  • 169
  • Volume

  • 67
  • Issue

  • 2