A malleable-job system for timeshared parallel machines

2nd IEEE/ACM International Symposium on Cluster Computing and the Grid, CCGrid 2002

Volumn , Issue , 2002, Pages 230-237

  Kale, Laxmikant V ^a   Kumar, Sameer ^a   Desouza, Jayant ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BALANCING; COMPUTER ARCHITECTURE; SCHEDULING;

JOB SCHEDULER; MALLEABLE JOBS; MASTER-WORKER PARADIGMS; PARALLEL MACHINE; PARALLEL PROGRAM; PROGRAMMING MODELS; PROGRAMMING SYSTEM; SYSTEM UTILIZATION;

CLUSTER COMPUTING;

EID: 10044276198     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCGRID.2002.1017131     Document Type: Conference Paper

References (25)

1. M.Bhandarkar, L.V.Kale, E.de Sturler, and J.Hoeflinger.Object-Based Adaptive Load Balancing for MPI Programs.In Proceedings of the International Conference on Computational Science, San Francisco, CA, LNCS 2074, pages 108-117, May 2001
2. J.A.Board, L.V.Kaĺe, K.Schulten, R.Skeel, and T.Schlick.Modeling biomolecules: Larger scales, longer durations.IEEE Computational Science and Engineering, 1(4), 1994
3. S.-H.Chiang and M.K.Vernon.Dynamic vs.static quantum-based parallel processor allocation.In D.G.Feitelson and L.Rudolph, editors, Job Scheduling Strategies for Parallel Processing, volume 1162 of Lecture Notes in Computer Science, pages 200-223.Springer-Verlag, 1996
4. D.W.Duke, T.P.Green, and J.L.Pasko.Research toward a heterogenous networked computing cluster: The distributed queueing system version 3.0.Technical report, Florida State University, May 1994
5. G.Edjlali, G.Agrawal, A.Sussman, and J.Saltz.Data parallel programming in an adaptive environment.In Proceedings of the 9th International Parallel Processing Symposium, 1995
6. D.G.Feitelson and L.Rudolph.Toward convergence in job schedulers for parallel supercomputers.In D.G.Feitelson and L.Rudolph, editors, Job Scheduling Strategies for Parallel Processing, volume 1162 of Lecture Notes in Computer Science, pages 1-26.Springer-Verlag, 1996
7. M.W.Hall and M.Martonosi.Adaptive parallelism in compiler-parallelized code.Concurrency: Practice and Experience, 10(14):1235-1250, 1998
8. S.Ioannidis, U.Rencuzogullari, R.Stets, and S.Dwarkadas.CRAUL: Compiler and run-time integration for adaptation under load.Journal of Scientific Programming, Aug.1999.Invited paper
9. N.Islam, A.Prodromidis, and M.Squillante.Dynamic partitioning in different distributed memory environments.In Job Scheduling Strategies for Parallel Processing, volume 1162 of Lecture Notes in Computer Science.Springer-Verlag, 1996
10. Jansen and Porkolab.Linear-time approximation schemes for scheduling malleable parallel tasks.In SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms), 1999
11. L.Kaĺe and S.Krishnan.CHARM++: A Portable Concurrent Object Oriented System Based on C++.In A.Paepcke, editor, Proceedings of OOPSLA'93, pages 91-108.ACM Press, September 1993
12. L.Kale and S.Krishnan.Charm++: A portable concurrent object oriented system based on C++.In Proceedings of the Conference on Object Oriented Programming Systems, Languages and Applications, September 1993
13. L.V.Kale, M.Bhandarkar, N.Jagathesan, S.Krishnan, and J.Yelon.Converse: An Interoperable Framework for Parallel Programming.In Proceedings of the 10th International Parallel Processing Symposium, pages 212-217, April 1996
14. L.V.Kale and S.Krishnan.Charm++: Parallel Programming with Message-Driven Objects.In G.V.Wilson and P.Lu, editors, Parallel Programming using C++, pages 175-213.MIT Press, 1996
15. W.Y.Lee, S.J.Hong, and J.Kim.On-line scheduling of scalable real-time tasks on multiprocessor systems
16. M.Litzkow and M.Solomon.Supporting checkpointing and process migration outside the unix kernel.In Usenix Winter Conference, 1992
17. J.E.Moreira and V.K.Naik.Dynamic resource management on distributed systems using reconfigurable applications.IBM Journal of Research and Development, 41(3):303, 1997
18. A.W.Mu'alem and D.G.Feitelson.Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling.IEEE Trans.on Parallel and Distributed Systems, 12(6), June 2001
19. J.Nagib, C.Á rebe, A.Beguelin, and B.Lowekamp.Dome: Parallel programming in a distributed computing environment.In Proceedings of the International Parallel Processing Symposium, 1996
20. T.D.Nguyen, R.Vaswani, and J.Zahorjan.Using runtime measured workload characteristics in parallel processor scheduling.In D.G.Feitelson and L.Rudolph, editors, Job Scheduling Strategies for Parallel Processing, volume 1162 of Lecture Notes in Computer Science.Springer-Verlag, 1996
21. J.Padhye and L.Dowdy.Preemptive versus nonpreemptive processor allocation policies for message passing parallel computers: An empirical comparison.In Proceedings of the 2nd Workshop on Job Scheduling Strategies for Parallel Processing, Apr.1996
22. Portable batch system.http://pbs.mrj.com/
23. J.Pruyne and M.Livny.Parallel Processing on Dynamic Resources with CARMI.In D.G.Feitelson and L.Rudolph, editors, Job Scheduling Strategies for Parallel Processing-IPPS'95 Workshop, volume 949, pages 259-278.Springer, 1995
24. A.Tucker and A.Gupta.Process control and scheduling issues for multiprogrammed shared-memory multiprocessors.In Proceedings of the 12th ACM SIGOPS Symposium on Operating Systems Principles, Dec.1989
25. Turing cluster.http://turing.cs.uiuc.edu/.