How to avoid herd: A novel stochastic algorithm in grid scheduling

Proceedings of the IEEE International Symposium on High Performance Distributed Computing

Volumn 2006, Issue , 2006, Pages 267-278

  Qinghua, Zheng ^a,b   Haijun, Yang ^c   Yuzhong, Sun ^a  

^a INSTITUTE OF COMPUTING TECHNOLOGY   (China)

^b UNIVERSITY OF CHINESE ACADEMY OF SCIENCES   (China)

^c BEIHANG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

GRID SCHEDULING; MULTI CHOICE ALGORITHM; STOCHASTIC ALGORITHM; SYSTEM UTILIZATION RATE;

ALGORITHMS; COMPUTER SIMULATION; PROBLEM SOLVING; RANDOM PROCESSES; SCHEDULING;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33845881470     PISSN: 10828907     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. F. Berman, A. Chien, K. Cooper, J. Dongarra, I. Foster, L. J. Dennis Gannon, K. Kennedy, C. Kesselman, D. Reed, L. Torczon, and R. Wolski, "The GrADS Project: Software Support for High-Level Grid Application Development," International Journal of High-performance Computing Applications, 15(4), Winter 2001.
2. M. Sato, H. Nakada, S. Sekiguchi, S. Matsuoka, U. Nagashima, and H. Takagi, "Ninf: A Network based Information Library for a Global World-Wide Computing Infrastracture," Proc. of HPCN'97 (LNCS-1225), pages 491-502, 1997.
3. M. Mitzenmacher, "How Useful is Old Information?" IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 1, pp. 6-20, Jan. 2000.
4. W. Cirne and F. Berman, "When the Herd Is Smart: The Aggregate Behavior in the Selection of Job Request," IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 2, pp. 181-192, Feb. 2003.
5. M. J. Litzkow, M. Livny, and M. W. Mutka, "Condor - A Hunter of Idle Workstations," Proc. 8th International Conference on Distributed Computing Systems (ICDCS 1988), pages 104-111, San Jose, CA, 1988.
6. R. Raman, M. Livny, and M. Solomon, "Matchmaking: Distributed Resource Management for High Throughput Computing," HPDC-7, pages 140-146, Chicago, IL, 1998.
7. R. Raman, M. Livny, and M. Solomon, "Resource Management through Multilateral Matchmaking," HPDC-9, pages 290-291, Pittsburgh, PA, 2000.
8. D. H. J. Epema, M. Livny, R. van Dantzig, X. Evers and J. Pruyne, "A Worldwide Flock of Condors: Load Sharing among Workstation Clusters," Future Generation Computer Systems, 12, 1996
9. A. R. Butt, R. Zhang, and Y. C. Hu, "A Self-Organizing Flock of Condors," ACM/IEEE SuperComputing '03.
10. D. Zagorodnov, F. Berman, and R. Wolski, "Application Scheduling on the Information Power Grid," International Journal of High-Performance Computing, 1998. 8
11. H. Casanova, A. Legrand and D. Zagorodnov et al, "Using Simulation to Evaluate Scheduling Heuristics for a Class of Applications in Grid Environments," Ecole Normale Superieure de Lyon, RR1999-46. 1999.
12. J. M. Schopf, and F. Berman, "Stochastic Scheduling," ACM/IEEE SuperComputing '99.
13. Y. Azar, A.Z. Broder, A.R. Karlin, E.Upfal, "Balanced Allocations," Proc. 26th Annual ACM Symposium on the Theory of Computing (STOC 94), pp. 593-602, 1994
14. B. Vöcking, "How Asymmetry Helps Load Balancing," Journal of the ACM, Vol. 50, No. 4, pp. 568-589, 2003.
15. B. Vöcking, "Symmetric vs. Asymmetric Multiple-Choice Algorithms (invited paper)," Proc. of 2nd ARACNE workshop (Aarhus, 2001), pp. 7-15
16. J. Ledlie, and M. Seltzer, "Distributed, Secure Load Balancing with Skew, Heterogeneity, and Churn," IEEE INFOCOM 2005, March 2005
17. K. Czajkowski, S. Fitzgerald, I. Foster, and C. Kesselman, "Grid Information Services for Distributed Resource Sharing," HPDC-10, August 2001.
18. The Globus Alliance, http://www.globus.org/
19. D. Oppenheimer, J. Albrecht, D. Patterson, and Amin Vahdat, "Scalable Wide-Area Resource Discovery," UC Berkeley Technical Report UCB//CSD-04-1334, July 2004.
20. The PlanetLab Home, http://www.planet-lab.org/
21. S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz, "Handling Churn in a DHT," Proc. of the USENIX Annual Technical Conference, 2004.
22. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, "Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications," ACM SIGCOMM 2001, San Deigo, CA, August 2001, pp. 149-160.
23. P. Brighten Godfrey and Ion Stoica, "Heterogeneity and Load Balance in Distributed Hash Tables," IEEE INFOCOM 2005, March 2005
24. S.M. Figueira, and F. Berman, "Modeling the Effects of Contention on the Performance of Heterogeneous Application," HPDC. 1996.
25. A. Medina, A. Lakhina, I. Matta, and J. Byers, "BRITE: An Approach to Universal Topology Generation," Proc. of the International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunications Systems-MASCOTS '01, Cincinnati, Ohio, Aug. 2001.
26. The Network Simulator - NS2, http://www.isi.edu/nsnam/ns/.