On the combined scheduling of malleable and rigid jobs

Proceedings - Symposium on Computer Architecture and High Performance Computing

Volumn , Issue , 2004, Pages 206-213

  Hungershöfer, Jan ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTING SYSTEMS; MALLEABLE JOBS; SHARED MEMORY SYSTEMS;

COMPUTER SIMULATION; FINITE ELEMENT METHOD; JOB ANALYSIS; MATHEMATICAL MODELS; PARALLEL ALGORITHMS; SCHEDULING; SUPERCOMPUTERS;

PARALLEL PROCESSING SYSTEMS;

EID: 16244403266     PISSN: 15506533     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SBAC-PAD.2004.27     Document Type: Conference Paper

References (19)

1. Computing center software (CCS), Apr. 2004. http://www.upb.de/pc2/projects/ccs/.
2. HPC workload/resource trace repository, Apr. 2004. http://supercluster.org/reseaxch/traces/.
3. J. Blazewicz, M. Machowiak, G. Mounié, and D. Trystram. Approximation algorithms for scheduling independent malleable tasks. In R. Sakellariou, editor, Proc. of Euro-Par 2001, volume 2150 of Lecture Notes in Computer Science, pages 191-197. Springer, Aug. 2001.
4. W. Cirne. Using Moldability to Improve the Performance of Supercomputer Jobs. PhD thesis, University of California, San Diego, Feb. 2001.
5. W. Cirne and F. Berman. A model for moldable supercomputer jobs. In Proc. of 15th Intl. Parallel & Distributed Processing Symp. 2001.
6. W. Cirne and F. Berman. Using moldability to improve the performance of supercomputer jobs, 2001.
7. P.-F. Dutot and D. Trystram. Scheduling on hierarchical clusters using malleable tasks. In Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures (SPAA), pages 199-208. ACM Press, 2001.
8. D. G. Feitelson. Job scheduling in multiprogrammed parallel systems. IBM Research Report, Hebrew University, Aug. 1997. Second Revision (1997).
9. D. G. Feitelson. Parallel workloads archive, Apr. 2004. http://www.cs.huji.ac.il/labs/parallel/workload/.
10. D. G. Feitelson, L. Rudolph, U. Schweigelshohn, K. Sevcik, and P. Wong. Job Scheduling Strategies for Parallel Processing, volume 1291 of Lecture Notes in Computer Science, chapter Theory and Practice in Parallel Job Scheduling, pages 1-34. Springer, 1997.
11. M. Hovestadt, O. Kao, A. Keller, and A. Streit. Scheduling in HPC Resource Management Systems: Queuing vs. Planning. In D. G. Feitelson and L. Rudolph, editor, Proc. of the 9th Workshop on Job Scheduling Strategies for Parallel Processing, volume 2862 of Lecture Notes in Computer Science, pages 1-20. Springer, 2003.
12. J. Hungershöfer, J.-M. Wierum, and H.-P. Gänser. Efficient shared memory parallelisation and resource management of explicit finite element codes. Technical Report TR-001-03, Paderborn Center for Parallel Computing, Dec. 2003.
13. J. Hungershöfer, J.-M. Wierum, and H.-P. Gänser. Resource management for finite element codes on shared memory systems. In M. L. Gavrilova, V. Kumar, P. L'Ecuyer, and C. J. K. Tan, editors, Proc. of Intl. Conf. on Computational Science and Its Applications (ICCSA), volume 2667 of Lecture Notes in Computer Science, pages 927-936. Springer, May 2003.
14. S. T. Leutenegger and M. K. Vernon. The performance of multiprogrammed multiprocessor scheduling policies. In Proc. ACM BIOMETRICS Conf. on Measurement and Modelling of Computer Systems, pages 226-236, 1990.
15. D. A. Lifka. The ANL/IBMSP scheduling system. In D. G. Feitelson and L. Rudolph, editors, Proc. of 1st Workshop on Job Scheduling Strategies for Parallel Processing, volume 949 of Lecture Notes in Computer Science, pages 295-303. Springer, 1995.
16. C. McCann, R. Vaswani, and J. Zarhojan. A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors. ACM Transactions on Computer Systems (TOCS), 11(2):146-178, May 1993.
17. J. Skovira, W. Chan, H. Zhou, and D. Lifka. The EASY LoadLeveler API project. In D. G. Feitelson and L. Rudolph, editors, Proc. of 2nd Workshop on Job Scheduling Strategies for Parallel Processing, volume 1162 of Lecture Notes in Computer Science, pages 41-47. Springer, 1996.
18. A. Streit. Self-Tuning Job Scheduling Strategies for the Resource Management of HPC Systems and Computational Grids. PhD thesis, Faculty of Computer Science, Electrical Engineering and Mathematics, Paderborn University, 2003.
19. A. Tucker and A. Gupta. Process control and scheduling issues for multiprogrammed shared-memory multiprocessors. In Proceedings of the twelfth ACM Symposium on Operating systems principles, pages 159-166. ACM Press, 1989.