A sequential cooperative game theoretic approach to storage-aware scheduling of multiple large-scale workflow applications in Grids

Proceedings - IEEE/ACM International Workshop on Grid Computing

Volumn , Issue , 2012, Pages 31-39

  Duan, Rubing ^a   Prodan, Radu ^b   Li, Xiaorong ^a  

^a INSTITUTE OF HIGH PERFORMANCE COMPUTING   (Singapore)

^b UNIVERSITY OF INNSBRUCK   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

CLOUD SYSTEMS; COOPERATIVE GAME; COST OPTIMISATION; EXECUTION TIME; GAME-THEORETIC; GRID APPLICATIONS; LARGE-SCALE APPLICATIONS; MAKESPAN; PROBLEM-BASED; REAL-WORLD APPLICATION; STORAGE CONSTRAINTS; WORKFLOW APPLICATIONS;

COMPUTATIONAL COMPLEXITY; COSTS; GAME THEORY; SCHEDULING; SCHEDULING ALGORITHMS;

GRID COMPUTING;

EID: 84869031565     PISSN: 15505510     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/Grid.2012.14     Document Type: Conference Paper

References (22)

1. T. D. Braun. A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. Journal of Parallel and Distributed Computing, 61(6):810837, 2001.
2. Rajkumar Buyya and Srikumar Venugopal. The Gridbus toolkit for service oriented Grid and utility computing: An overview and status report. In 1st International Workshop on Grid Economics and Business Models, pages 19-36. IEEE Computer Society Press, 2004.
3. Amir Danak and Shie Mannor. Bidding efficiently in repeated auctions with entry and observation costs. In 1st ICST international conference on Game Theory for Networks, GameNets'09, pages 299-307. IEEE Press, 2009.
4. Rubing Duan, Radu Prodan, and Thomas Fahringer. Performance and cost optimization for multiple large-scale Grid workflow applications. In ACM/IEEE Conference on Supercomputing, pages 1-12. ACM, November 2007.
5. C.Kim et al. An algorithm for optimal load balancing in distributed computer systems. IEEE Transactions on Computers, 41(3):381-384, 1992.
6. Jonathan Bredin et al. A game-theoretic formulation of multi-agent resource allocation. In Proceedings of the Fourth International Conference on Autonomous Agents, pages 349-356, Barcelona, Catalonia, Spain, 2000. ACM Press.
7. Muthucumaru Maheswaran et al. Dynamic mapping of a class of independent tasks onto heterogeneous computing systems. Journal of Parallel and Distributed Computing, 59(2):107-131, 1999. (Pubitemid 129557480)
8. Tracy D. Braun et al. A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. Journal of Parallel and Distributed Computing, 61(6):810-837, 2001. (Pubitemid 33658407)
9. Preetam Ghosh, Kalyan Basu, and Sajal K. Das. A game theory-based pricing strategy to support single/multiclass job allocation schemes for bandwidth-constrained distributed computing systems. IEEE Trans. Parallel Distrib. Syst., 18(3):289-306, 2007. (Pubitemid 46453566)
10. R. Jain, D. Chiu, and W. Hawe. A quantitative measure of fairness and discrimination for resource allocation in shared computer systems, 1998.
11. B. Kao and H. Garcia-Molina. Deadline assignment in a distributed soft real-time system. IEEE Transactions on Parallel and Distributed Systems, 8(12):1268-1274, 1997. (Pubitemid 127767772)
12. W. Kapferer, W. Domainko, S. Schindler, E. Van Kampen, S. Kimeswenger, M. Mair, T. Kronberger, and D. Breitschwerdt. Metal enrichment and energetics of galactic winds in galaxy clusters. Advances in Space Research, 36:682, 2005.
13. Y. Kwok, S. Song, and K. Hwang. Selfish grid computing: Gametheoretic modeling and nas performance results, 2005.
14. Yu-Kwong Kwok, Kai Hwang, and ShanShan Song. Selfish grids: Game-theoretic modeling and nas/psa benchmark evaluation. IEEE Transactions on Parallel and Distributed Systems, 18:621-636, 2007. (Pubitemid 46681264)
15. Roger B. Myerson. Game Theory: Analysis of Conflict. Harvard University Press, September 1997.
16. S. Penmatsa and A. T. Chronopoulos. Cooperative load balancing for a network of heterogeneous computers. In IEEE, editor, Proc. of the 21st IEEE Intl. Parallel and Distributed Processing Symposium (IPDPS 2006), Rhodes Island, Greece, April 25-29 2006.
17. Radu Prodan and Rubing Duan. Cooperative game theory-based cost optimization for scientific workflows. In Rajkumar Buyya and Kris Bubendorfer, editors, Market Oriented Grid and Utility Computing, chapter 21, pages 475-494. John Wiley & Sons, November 2009.
18. Arun Ramakrishnan, Gurmeet Singh, Henan Zhao, Ewa Deelman, Rizos Sakellariou, Karan Vahi, Kent Blackburn, David Meyers, and Michael Samidi. Scheduling data-intensiveworkflows onto storage-constrained distributed resources. In 7th International Symposium on Cluster Computing and the Grid, pages 401-409. IEEE Computer Society, 2007. (Pubitemid 47334578)
19. K. Schwarz, P. Blaha, and G. K. H. Madsen. Electronic structure calculations of solids using the wien2k package for material sciences. Computer Physics Communications, 147(71), 2002.
20. S. S. Vadhiyar and J. J. Dongarra. A metascheduler for the grid. In 11th International Symposium on High Performance Distributed Computing. IEEE Computer Society, July 2002.
21. S. Venugopal and R. Buyya. A deadline and budget constrained scheduling algorithm for e-scienceapplications on data Grids. In 6th International Conference on Algorithms and Architectures forParallel Processing, volume 3719 of LNCS. Springer, 2005.
22. J. Yu and R. Buyya. A budget constrained scheduling of workflow applications on utility grids using genetic algorithms. In 1st Workshop on Workflows in Support of Large-Scale Science. IEEE Computer Society, June 2006.