Adaptive scheduling under memory constraints on non-dedicated computational farms

Future Generation Computer Systems

Volumn 19, Issue 4, 2003, Pages 505-519

  Nikolopoulos, Dimitrios S ^a   Polychronopoulos, Constantine D ^b  

^a The College of William and Mary   (United States)

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

Author keywords

Clusters; Computational grids; Memory management; Scheduling

Indexed keywords

COMPUTER SOFTWARE; COMPUTER WORKSTATIONS; INPUT OUTPUT PROGRAMS; STORAGE ALLOCATION (COMPUTER);

CENTRAL PROCESSING UNIT (CPU); COMPUTATIONAL GRIDS;

PARALLEL PROCESSING SYSTEMS;

EID: 0037403394     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-739X(03)00031-1     Document Type: Conference Paper

References (18)

1. A. Acharya, G. Edjlali, J. Saltz, The utility of exploiting idle workstations for parallel computation, in: Proceedings of the 1997 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS'97), Seattle, WA, June 1997, pp. 225-236.
2. A. Acharya, S. Setia, Availability and utility of idle memory in workstation clusters, in: Proceedings of the 1999 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems (SIGMETRICS'99), Atlanta, GA, May 1999, pp. 35-46.
3. Arpaci-Dusseau A. Implicit coscheduling: coordinated scheduling with implicit information in distributed systems. ACM Trans. Comput. Syst. 19(3):2001;283-331.
4. A. Batat, D. Feitelson, Gang scheduling with memory considerations, in: Proceedings of the 14th IEEE International Parallel and Distributed Processing Symposium (IPDPS'2000), Cancun, Mexico, May 2000, pp. 109-114.
5. D. Burger, R. Hyder, B. Miller, D. Wood, Paging tradeoffs in distributed-shared-memory multiprocessors, in: Proceedings of the IEEE/ACM Supercomputing'94: High Performance Networking and Computing Conference (SC'94), Washington, DC, November 1994, pp. 590-599.
6. Caldera International Inc., AIM Independent Resource Benchmark, Suite VII, 2001.
7. J. Frey, T. Tannenbaum, M. Livny, I. Foster, S. Tuecke, Condor-G: a computation management agent for multi-institutional grids, in: Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing (HPDC-10), San Francisco, CA, August 2001, pp. 55-63.
8. F. Giné, F. Solsona, P. Hernandez, E. Luque, Coscheduling under memory constraints in a now environment, in: Proceedings of the Seventh Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP'01), in conjunction with ACM SIGMETRICS'01, Boston, MA, June 2001.
9. S. Jiang, X. Zhang, Adaptive page replacement to protect thrashing in Linux, in: Proceedings of the Fifth Annual Linux Showcase and Conference, Oakland, CA, November 2001.
10. C. McCann, J. Zahorjan, Scheduling memory constrained jobs on distributed memory parallel computers, in: Proceedings of the 1995 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems (SIGMETRICS'95), Ottawa, Canada, May 1995, pp. 208-219.
11. R. Mills, A. Stathopoulos, E. Smirni, Algorithmic modifications to the Jacobi-Davidson parallel eigensolver to dynamically balance external CPU and memory load, in: Proceedings of the 15th ACM International Conference on Supercomputing (ICS'2001), Sorrento, Italy, June 2001, pp. 454-463.
12. D. Nikolopoulos, C. Polychronopoulos, Adaptive scheduling under memory pressure on multiprogrammed clusters, in: Proceedings of the Second IEEE/ACM International Conference on Cluster Computing and the Grid (ccGrid'02), Berlin, Germany, May 2002, pp. 22-29.
13. D. Nikolopoulos, C. Polychronopoulos, Adaptive scheduling under memory pressure on multiprogrammed SMPs, in: Proceedings of the 16th IEEE International Parallel and Distributed Processing Symposium (IPDPS'2002), Fort Lauderdale, FL, April 2002.
14. J. Ousterhout, Scheduling techniques for concurrent systems, in: Proceedings of the Third International Conference on Distributed Computing Systems (ICDCS'82), Miami, FL, October 1982, pp. 22-30.
15. E. Parsons, K. Sevcik, Coordinated allocation of memory and processors in multiprocessors, in: Proceedings of the 1996 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems (SIGMETRICS'96), Philadelphia, PA, May 1996, pp. 57-67.
16. K. Ryu, J. Hollingsworth, P. Keleher, Mechanisms and policies for supporting fine-grain cycle stealing, in: Proceedings of the 13th ACM International Conference on Supercomputing (ICS'99), Rhodes, Greece, June 1999, pp. 93-100.
17. S. Setia, The interaction between memory allocation and adaptive partitioning in message-passing multicomputers, in: Proceedings of the First Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP'95), in conjunction with IEEE IPPS'95, Lecture Notes in Computer Science, vol. 949, Santa Barbara, CA, April 1995, pp. 146-165.
18. P. Sobalvarro, S. Pakin, W. Weihl, A. Chien, Dynamic coscheduling on workstation clusters, in: Proceedings of the Fourth Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP'98), Lecture Notes in Computer Science, vol. 1459, Orlando, FL, April 1998, pp. 231-256.