Title
A sequential cooperative game theoretic approach to scheduling multiple large-scale applications in grids.
Abstract
Scheduling large-scale applications in heterogeneous distributed computing systems is a fundamental NP-complete problem that is critical to obtaining good performance and execution cost. In this paper, we address the scheduling problem of an important class of large-scale Grid applications inspired by the real world, characterized by a huge number of homogeneous, concurrent, and computationally intensive tasks that are the main sources of performance, cost, and storage bottlenecks. We propose a new formulation of this problem based on a cooperative distributed game-theory-based method applied using three algorithms with low time complexity for optimizing three important metrics in scientific computing: execution time, economic cost, and storage requirements. We present comprehensive experiments using simulation and real-world applications that demonstrate the effectiveness of our approach in terms of time and fairness compared to other related algorithms. We schedule large-scale Grid applications with a huge identical parallel tasks.We formulate the problem using a cooperative distributed game-theory-based method.We design three algorithms for optimizing time, cost, and storage requirements.We evaluate our method using simulation and real-world applications.We compare our results with related algorithms.
Year
DOI
Venue
2014
10.1016/j.future.2013.09.001
Future Generation Comp. Syst.
Keywords
DocType
Volume
execution time,sequential cooperative game theoretic,fundamental np-complete problem,multiple large-scale application,low time complexity,important class,scheduling problem,economic cost,large-scale grid application,good performance,execution cost,important metrics,grid computing,performance,game theory,scheduling
Journal
30
Issue
ISSN
Citations 
C
0167-739X
3
PageRank 
References 
Authors
0.39
31
3
Name
Order
Citations
PageRank
Rubing Duan123516.38
Radu Prodan22314152.27
Xiaorong Li3473.62