ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
An evaluation of parallel job scheduling for ASCI Blue-Pacific
Full text PdfPdf (171 KB)
Source
Conference on High Performance Networking and Computing archive
Proceedings of the 1999 ACM/IEEE conference on Supercomputing (CDROM) table of contents
Portland, Oregon, United States
Article No. 45  
Year of Publication: 1999
ISBN:1-58113-091-0
Authors
H. Franke  IBM T. J. Watson Research Center, Yorktown Heights, NY
J. Jann  IBM T. J. Watson Research Center, Yorktown Heights, NY
J. E. Moreira  IBM T. J. Watson Research Center, Yorktown Heights, NY
P. Pattnaik  IBM T. J. Watson Research Center, Yorktown Heights, NY
M. A. Jette  Lawrence Livermore National Laboratory, Livermore CA
Sponsors
IEEE-CS\TCCA : TC on Computer Arhitecture
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 18,   Citation Count: 11
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/331532.331577
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
D. G. Feitelson. A Survey of Scheduling in Multiprogrammed Parallel Systems. Technical Report RC 19790 (87657), IBM T. J. Watson Research Center, October 1994.
 
2
Dror G. Feitelson , Morris A. Jette, Improved Utilization and Responsiveness with Gang Scheduling, Proceedings of the Job Scheduling Strategies for Parallel Processing, p.238-261, April 05, 1997
 
3
A. Weil, Utilization and Predictability in Scheduling the IBM SP2 with Backfilling, Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium, p.542, March 30-April 03, 1998
 
4
H. Franke , P. Pattnaik , L. Rudolph, Gang scheduling for highly efficient, distributed multiprocessor systems, Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation, p.4, March 27-31, 1996
 
5
B. Gorda and R. Wolski. Time Sharing Massively Parallel Machines. In International Conference on Parallel Processing, volume II, pages 214-217, August 1995.
 
6
Nayeem Islam , Mark S. Squillante , Liana L. Fong , Ajei S. Gopal , Andreas L. Prodromidis, Extensible Resource Management For Cluster Computing, Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97), p.561, May 27-30, 1997
 
7
Joefon Jann , Pratap Pattnaik , Hubertus Franke , Fang Wang , Joseph Skovira , Joseph Riordan, Modeling of Workload in MPPs, Proceedings of the Job Scheduling Strategies for Parallel Processing, p.95-116, April 05, 1997
 
8
M. Jette, D. Storch, and E. Yim. Timesharing the Cray T3D. Cray User Group, pages 247-252, March 1996.
 
9
M. A. Johnson and M. R. Taaffe. Matching Moments to Phase Distributions: Mixtures of Erlang Distributions of Common Order. Communications in Statistics - Stochastic Models, 5(4):711-743, 1989.
 
10
David A. Lifka, The ANL/IBM SP Scheduling System, Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing, p.295-303, April 25, 1995
 
11
J. E. Moreira , W. Chan , L. L. Fong , H. Franke , M. A. Jette, An infrastructure for efficient parallel job execution in Terascale computing environments, Proceedings of the 1998 ACM/IEEE conference on Supercomputing (CDROM), p.1-14, November 07-13, 1998, San Jose, CA
 
12
José E. Moreira , Hubertus Franke , Waiman Chan , Liana L. Fong , Morris A. Jette , Andy Yoo, A Gang-Scheduling System for ASCI Blue-Pacific, Proceedings of the 7th International Conference on High-Performance Computing and Networking, p.831-840, April 12-14, 1999
 
13
Randolph Nelson, Probability, stochastic processes, and queueing theory: the mathematics of computer performance modeling, Springer-Verlag New York, Inc., New York, NY, 1995
 
14
J. K. Ousterhout. Scheduling Techniques for Concurrent Systems. In Third International Conference on Distributed Computing Systems, pages 22-30, 1982.
 
15
Uwe Schwiegelshohn , Ramin Yahyapour, Improving First-Come-First-Serve Job Scheduling by Gang Scheduling, Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing, p.180-198, March 30, 1998

CITED BY  11
Yanyong Zhang , Anand Sivasubramaniam , Jose Moreira , Hubertus Franke, A simulation-based study of scheduling mechanisms for a dynamic cluster environment, Proceedings of the 14th international conference on Supercomputing, p.100-109, May 08-11, 2000, Santa Fe, New Mexico, United States
Eitan Frachtenberg , Fabrizio Petrini , Juan Fernandez , Scott Pakin , Salvador Coll, STORM: lightning-fast resource management, Proceedings of the 2002 ACM/IEEE conference on Supercomputing, p.1-26, November 16, 2002, Baltimore, Maryland
Yanyong Zhang , Anand Sivasubramaniam , José Moreira , Hubertus Franke, Impact of Workload and System Parameters on Next Generation Cluster Scheduling Mechanisms, IEEE Transactions on Parallel and Distributed Systems, v.12 n.9, p.967-985, September 2001
Takayuki Osogami , Mor Harchol-Balter, Closed form solutions for mapping general distributions to quasi-minimal PH distributions, Performance Evaluation, v.63 n.6, p.524-552, June 2006
Gyu Sang Choi , Saurabh Agarwal , Jin-Ha Kim , Chita R. Das , Andy B. Yoo, Performance Comparison of Coscheduling Algorithms for Non-Dedicated Clusters Through a Generic Framework, International Journal of High Performance Computing Applications, v.21 n.1, p.91-105, February 2007
Jung-Lok Yu , Jin-Soo Kim , Seung-Ryoul Maeng, A runtime resolution scheme for priority boost conflict in implicit coscheduling, The Journal of Supercomputing, v.40 n.1, p.1-28, April 2007
Hongzhang Shan , Leonid Oliker , Rupak Biswas, Job Superscheduler Architecture and Performance in Computational Grid Environments, Proceedings of the 2003 ACM/IEEE conference on Supercomputing, p.44, November 15-21, 2003
Olaf Arndt , Bernd Freisleben , Thilo Kielmann , Frank Thilo, A comparative study of online scheduling algorithms for networks of workstations, Cluster Computing, v.3 n.2, p.95-112, 2000
Alexandru Iosup , Dick H. J. Epema , Todd Tannenbaum , Matthew Farrellee , Miron Livny, Inter-operating grids through delegated matchmaking, Proceedings of the 2007 ACM/IEEE conference on Supercomputing, November 10-16, 2007, Reno, Nevada
Angela C. Sodan , Xuemin Huang, Adaptive time/space sharing with SCOJO, International Journal of High Performance Computing and Networking, v.4 n.5/6, p.256-269, May 2006
Alexandru Iosup , Todd Tannenbaum , Matthew Farrellee , Dick Epema , Miron Livny, Inter-operating grids through Delegated MatchMaking, Scientific Programming, v.16 n.2-3, p.233-253, April 2008

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.2 Modes of Computation
          Subjects: Parallelism and concurrency

Additional Classification:
  C. Computer Systems Organization
  C.5 COMPUTER SYSTEM IMPLEMENTATION

  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Sequencing and scheduling


General Terms:
Design, Measurement, Performance, Theory

Collaborative Colleagues:
H. Franke: colleagues
J. Jann: colleagues
J. E. Moreira: colleagues
P. Pattnaik: colleagues
M. A. Jette: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player