On QoS-Based Scheduling of a Meta-Task with Multiple QoS Demands in Heterogeneous Computing

  • Authors:
  • Atakan Dogan;Füsun Özgüner

  • Affiliations:
  • -;-

  • Venue:
  • IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper investigates the problem of scheduling a set of independent tasks with multiple QoS needs, which may include timeliness, reliability, security, data accuracy, and priority, in a heterogeneous computing system. This problem is referred to as the QoS-based scheduling problem and proven to be NP-hard. In order to solve the QoSbased scheduling problem, a computationally efficient static scheduling algorithm (QSMTS IP) is developed. The simulation studies carried out show that QSMTS IP is capable of meeting diverse QoS requirements of many users simultaneously, while minimizing the number of users whose tasks cannot be scheduled due to the scarcity of resources.