Local Scheduling out-performs Gang Scheduling on a Beowulf Cluster

[1]  Dror G. Feitelson,et al.  Paired Gang Scheduling , 2003, IEEE Trans. Parallel Distributed Syst..

[2]  Peter E. Strazdins,et al.  The analysis and optimization of collective communications on a Beowulf cluster , 2002, Ninth International Conference on Parallel and Distributed Systems, 2002. Proceedings..

[3]  Dror G. Feitelson,et al.  Metrics for Parallel Job Scheduling and Their Convergence , 2001, JSSPP.

[4]  Uwe Schwiegelshohn,et al.  Fairness in parallel job scheduling , 2000 .

[5]  Dror G. Feitelson,et al.  Gang scheduling with memory considerations , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[6]  Isaac D. Scherson,et al.  Improving Parallel Job Scheduling Using Runtime Measurements , 2000, JSSPP.

[7]  Richard P. Brent,et al.  Job Scheduling Strategies for Networks of Workstations , 1998, JSSPP.

[8]  Larry Rudolph,et al.  Evaluation of Design Choices for Gang Scheduling Using Distributed Hierarchical Control , 1996, J. Parallel Distributed Comput..

[9]  Yutaka Ishikawa,et al.  Implementation of Gang-Scheduling on Workstation Cluster , 1996, JSSPP.

[10]  Patrick Sobalvarro,et al.  Demand-Based Coscheduling of Parallel Jobs on Multiprogrammed Multiprocessors , 1995, JSSPP.

[11]  Larry Rudolph,et al.  Gang Scheduling Performance Benefits for Fine-Grain Synchronization , 1992, J. Parallel Distributed Comput..

[12]  P. Strazdins.  A comparison of lookahead and algorithmic blocking techniques for parallel matrix factorization , 1998 .