Benefit of limited time sharing in the presence of very large parallel jobs

Proceedings - 19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005

Volumn 2005, Issue , 2005, Pages

  Chiang, Su Hui ^a   Fu, Chuyong ^a  

^a Portland State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GANG SCHEDULING; JOB SCHEDULING; PARALLEL SYSTEMS; TIME-SHARING;

COMPUTER SIMULATION; PROBLEM SOLVING; RESOURCE ALLOCATION;

PARALLEL PROCESSING SYSTEMS;

EID: 33746299848     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2005.125     Document Type: Conference Paper

References (15)

1. S.-H. Chiang, A. Dusseau-Arpaci, and M. K. Vernon. The impact of more accurate requested runtimes on production job scheduling performance. In Proc. 8th Workshop on Job Scheduling Strategies for Parallel Processing, Edinburgh, Scotland, July 2002.
2. S.-H. Chiang and C. Fu. Re-evaluating reservation policies for backfill scheduling on parallel systems. In Proc. 16th IASTED Int'l Conf. on Parallel and Distributed Computing and Systems (PDCS), Cambridge, MA., Nov. 2004.
3. S.-H. Chiang and M. K. Vernon. Production job scheduling for parallel shared memory systems. In Proc. Int'l. Parallel and Distributed Processing Symp. (IPDPS) 2001, San Francisco, Apr. 2001.
4. S.-H. Chiang and M. K. Vernon. Class-partitioning job scheduling for large-scale parallel systems. In Proc. 2004 Int'l Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA), Las Vegas, June 2004.
5. D. G. Feitelson. Packing schemes for gang scheduling. In Proc. 2nd Workshop on Job Scheduling Strategies for Parallel Processing, Honolulu, Apr. 1996.
6. E. Frachtenberg, D. G. Feitelson, J. Fernandez, and F. Petrini. Parallel job scheduling under dynamic workloads. In Proc. 9th Workshop on Job Scheduling Strategies for Parallel Processing, Seattle, June 2003.
7. H. Franke, J. Jann, J. Moreira, P. Pattnaik, and M. Jette. An evaluation of parallel job scheduling for ASCI Blue-Pacific. In Proc. 1999 ACM/IEEE Supercomputing Conf., Portland, Nov. 1999.
8. J. P. Jones and B. Nitzberg. Scheduling for parallel super-computing: A historical perspective of achievable utilization. In Proc. 5th Workshop on Job Scheduling Strategies for Parallel Processing, San Juan, Puerto Rico, Apr. 1999.
9. C. McCann, R. Vaswani, and J. Zahorjan. Dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors. ACM Trans. on Computer Systems, 11(2):146-178, May 1993.
10. S. K. Setia. Trace-driven analysis of migration-based gang scheduling policies for parallel computers. In Proc. Int'l. Conf. Parallel Processing, pages 489-492, 1997.
11. E. Shmueli and D. G. Feitelson. Backfilling with lookahead to optimize the performance of parallel job scheduling. In Proc. 9th Workshop on Job Scheduling Strategies for Parallel Processing, Seattle, June 2003.
12. S. Srinivasan, R. Kettimuthu, V. Subramani, and P. Sadayappan. Selective reservation strategies for backfill job scheduling. In Proc. 8th Workshop on Job Scheduling Strategies for Parallel Processing, Edinburgh, Scotland, July 2002.
13. Y. Zhang, H. Franke, J. E. Moreira, and A. Sivasubramaniam. Improving parallel job scheduling by combining gang scheduling and backfilling techniques. In Proc. Int'l. Parallel and Distributed Processing Symp. (IPDPS) 2000, Cancun, May 2000.
14. B. B. Zhou and R. P. Brent. On the development of an efficient coscheduling system. In Proc. 7th Workshop on Job Scheduling Strategies for Parallel Processing, Cambridge, MA., June 2001.
15. B. B. Zhou, D. Walsh, and R. P. Brent. Resource allocation schemes for gang scheduling. In Proc. 6th Workshop on Job Scheduling Strategies for Parallel Processing, Cancun, May 2000.