Nash equilibrium based task scheduling algorithm of multi-schedulers in grid computing

Tien Tzu Hsueh Pao/Acta Electronica Sinica

Volumn 37, Issue 2, 2009, Pages 329-333

  Yi, Kan ^a   Wang, Ru Chuan ^a,b  

^a NANJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

^b NANJING UNIVERSITY   (China)

Author keywords

Grid; Nash equilibrium; PSO; Repast; Task scheduling

Indexed keywords

GRID COMPUTING; MULTITASKING; SCHEDULING; TELECOMMUNICATION NETWORKS;

GRID; NASH EQUILIBRIUM; PSO; REPAST; TASK SCHEDULING;

SCHEDULING ALGORITHMS;

EID: 63049122548     PISSN: 03722112     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. Muthucumaru Maheswaran, Shoukat Ali, Howard Jay Siegel, Debra Hensgen, Richard F Freund. Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems [A]. 8th Heterogeneous Computing Workshop (HCW'99) [C]. San Juan, Puerto Rico: IEEE Computer Society Press, 1999. 25-55.
2. Vincenzo D M, Marco M. Sub optimal scheduling in a grid using genetic algorithms [J]. Parallel Computing, 2004, 30 (5-6): 553-565.
3. Buyya Rajkumar. Economic-based Distributed Resource Management and Scheduling for Grid Computing [D]. Melbourne, Australia: Monash University, 2002.
4. Rzadca Krzysztof, Denis Trystram, Adam Wierzbicki. Fair game-theoretic resource management in dedicated grids [A]. Cluster Computing and the Grid, 2007. CCGRID 2007 [C]. Rio de Janeiro, Brazil: IEEE Press. 2007. 343-350.
5. Tao Jun, Wu Qing-liang, Wu Qiang. Application research of network resource allocation algorithm based on non-cooperative bidding game [J]. Acta Electronica Sinica, 2006. 34 (02): 241-246. (in Chinese)
6. Altman Eitan. Nash equilibria in load balancing in distributed computer systems [J]. International Game Theory Review, 2002. 4 (2): 1-10.
7. Daniel Grosua, Anthony T Chronopoulosb. Noncooperative load balancing in distributed systems [J]. Parallel Distrib. Comput, 2005, 65 (09): 1022-1034.
8. Constantinos Daskalakis, Paul W Goldberg, Christos H Papadimitriou. The complexity of computing a nash equilibrium [A]. STOC 2006 [C]. Seattle, WA, USA: ACM press, 2005. 71-78.
9. Datta Ruchira S. Using computer algebra to find nash equilibria [A]. ISSAC'03 [C]. Philadelphia, Pennsylvania USA: ACM press, 2003. 74-93.
10. Riechmann Thomas. Genetic algorithm learning and evolutionary games [J]. Journal of Economic Dynamics & Control, 2001, 25 (6): 1019-1037.
11. Xiaohui Hu, Russell Eberhart. Solving constrained nonlinear optimization problems with particle swarm optimization [A]. Proceedings of the Sixth World Multiconference on Systemics [C]. Orlando, USA: Cybernetics and Informatics, 2002. 203-206.
12. Slawomir Koziel, Zbigniew Michalewicz. Evolutionary algorithms, homomorphous mappings, and constrained parameter optimization [J]. Evolutionary Computation, 1999, 7 (1): 19-44.
13. Efrén Mezura-Montes, Carlos A, Coello Coello. A simple multi-membered evolution strategy to solve constrained optimization problems [J]. IEEE Transactions on Evolutionary Computation, 2005, 9 (1): 1-17.
14. Michael J North, Nicholson T Collier, Jerry R Vos. Experiences creating three implementations of the repast agent modeling toolkit [J]. ACM Transactions on Modeling and Computer Simulation, 2006, 16 (1): 1-25.