On QoS-based scheduling of a meta-task with multiple QoS demands in heterogeneous computing


Doǧan A., Özgüner F.

16th International Parallel and Distributed Processing Symposium, IPDPS 2002, Florida, United States Of America, 15 - 19 April 2002, pp.477-482 identifier

  • Publication Type: Conference Paper / Full Text
  • Doi Number: 10.1109/ipdps.2002.1015532
  • City: Florida
  • Country: United States Of America
  • Page Numbers: pp.477-482
  • Anadolu University Affiliated: No

Abstract

© 2002 IEEE.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 QoS-based 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 marry users simultaneously, while minimizing the number of users whose tasks cannot be scheduled due to the scarcity of resources.