Scheduling independent tasks with QoS requirements in grid computing with time-varying resource prices

43Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper considers the problem of scheduling a set of independent tasks with multiple QoS requirements, which may include timeliness, reliability, security, version, and priority, in a Grid computing system in which resource prices can vary with time during scheduling time intervals. This problem is referred to as the QoS-based scheduling problem with time-varying resource prices. In order to solve this problem, a static scheduling algorithm (QSMTS-VP) is developed. The simulation studies carried out show that QSMTS-VP is capable of meeting diverse QoS requirements of many users simultaneously and that QSMTS-VP can react to the dynamics of the market. Thus, QSMTS-VP is a promising heuristic that can be deployed in a computational market. © Springer-Verlag Berlin Heidelberg 2002.

Cite

CITATION STYLE

APA

Doǧan, A., & Özgüner, F. (2002). Scheduling independent tasks with QoS requirements in grid computing with time-varying resource prices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2536 LNCS, pp. 58–69). https://doi.org/10.1007/3-540-36133-2_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free