Skip to main content

Requirements of the Cornell Theory Center for resource management and process scheduling

  • Conference paper
  • First Online:
Job Scheduling Strategies for Parallel Processing (JSSPP 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 949))

Included in the following conference series:

Abstract

The Cornell Theory Center serves a large and heterogeneous community of users. We have recently installed an IBM POWERParallelâ„¢ SP2â„¢ that is similarly large and functionally heterogeneous. We expect that as machine utilization increases, stresses will occur in our scheduling environment that will tax our ability to maintain an efficient mapping between processes and processors. The system and workload of the Theory Center will be outlined. We also discuss our current scheduling system and our future requirements for a robust and efficient resource management/process scheduling system.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Messina, P. and T. Sterling, ed. Systems Software and Tools for High Performance Computing Environments. 1993, SIAM: Philadelphia, PA.

    Google Scholar 

  2. Kleinrock, L. and J.-H. Huang, On Parallel Systems: Amdahl's Law Generalized and Some Results on Optimal Design. IEEE Transactions on Software Engineering, 1992. 18(5): p. 434–447.

    Google Scholar 

  3. Norman, M.G. and P. Thanisch, Models of Machines and Computation for Mapping in Multicomputers. ACM Computing Surveys, 1993. 25(3): p. 263–302.

    Google Scholar 

  4. Plata, O. and F.F. Rivera, Combining Static and Dynamic Scheduling on Distributed-Memory Multiprocessors. p. 186–195. in International Conference on Supercomputing. 1994. Manchester, England, UK: ACM Press.

    Google Scholar 

  5. Goswami, K.K., M. Devakonda, and R.K. Iyer, Prediction-Based Dynamic Load-Sharing Heuristics. IEEE Transactions on Parallel and Distributed Systems, 1993. 4(6): p. 638–648.

    Google Scholar 

  6. Leff, A. and P.S. Yu, A Performance Study of Robust Distributed Load Sharing Strategies. IEEE Transactions on Parallel and Distributed Systems, 1994. 5(12): p. 1286–1301.

    Google Scholar 

  7. Cypher, R., et al. Architectural Requirements of Parallel Scientific Applications with Explicit Communication. p. 2–13 in Twentieth Annual International Conference on Computer Architecture. 1993. San Diego, CA: IEEE Computer Society Press.

    Google Scholar 

  8. Purakayastha, A., et al., Characterizing Parallel File-Access Patterns on a Large-Scale Multiprocessor, 1994, Department of Computer Science, Duke University

    Google Scholar 

  9. Kotz, D. and N. Nieuwejaar. Dynamic File-Access Characteristics of a Production Parallel Scientific Workload. p. 640–649 in Supercomputing '94. 1994. Washington, D.C.: IEEE Computer Society Press, Los Alamitos, CA.

    Google Scholar 

  10. Application Working Group of the Scalable I/O Initiative, Preliminary Survey of I/O Intensive Applications 1994, CalTech Concurrent Supercomputing Facilities, California Institute of Technology, 1994.

    Google Scholar 

  11. Naik, V.K., S.K. Setia, and M.S. Squillante. Scheduling of Large Scientific Applications on Distributed Memory Multiprocessor Systems in Sixth SIAM Conference on Parallel Processing for Scientific Computing. 1993. SIAM.

    Google Scholar 

  12. Peris, V.G.J., M.S. Squillante, and V.K. Naik, Analysis of the Impact of Memory in Distributed Parallel Processing Systems. Performance Evaluation Review, 1994. 22(1): p. 5–18.

    Google Scholar 

  13. Setia, S.K., M.S. Squillante, and S.K. Tripathi, Processor Scheduling on Multiprogrammed, Distributed Memory Parallel Computers. Performance Evaluation Review, 1993. 21(1): p. 158–170.

    Google Scholar 

  14. Setia, S.K., M.S. Squillante, and S.K. Tripathi, Analysis of Processor Allocation in Multiprogrammed, Distributed-Memory Parallel Processing Systems. IEEE Transactions on Parallel and Distributed Systems, 1994. 5(4): p. 401–420.

    Google Scholar 

  15. Stunkel, C.B., et al., The SP2 Communication Subsystem, 1994, IBM Corp.

    Google Scholar 

  16. Freund, R., 1994, Naval Command, Control and Ocean Surveillance Center; Research, Development, Test and Evaluation Division. SmartNet is a software package developed at NRAD by R. Freund, et al. See also the Heterogenous Computing Challenge competition at Supecomputing 94, Washington, D.C. November 1994.

    Google Scholar 

  17. Chapin, S.J. and E.H. Spafford, Support for Implementing Scheduling Algorithms Using MESSIAHS. Scientific Programming, 1994. 3: p. 325–340.

    Google Scholar 

  18. Aerts, A.T.M., et al., 'PLATE': A Decision Support System for Resource Constrained Scheduling Problems. European Journal of Operations Research, 1994. 79: p. 158–166.

    Google Scholar 

  19. Minciardi, R., M. Paolucci, and P.P. Puliafito, Development of a Heuristic Project Scheduler Under Resource Constraints. European Journal of Operations Research, 1994. 79: p. 176–182.

    Google Scholar 

  20. Nowicki, E. and C. Smutnicki, A Decision Support System for the Resource Constrained Scheduling Problem. European Journal of Operations Research, 1994. 79: p. 183–195.

    Google Scholar 

  21. Serafini, P. and M.G. Speranza, A Decomposition Approach in a DSS for a Resource Constrained Scheduling Problem. European Journal of Operations Research, 1994. 79: p. 208–219.

    Google Scholar 

  22. Goldberg, D.E., Genetic Algorithms in Search, Optimization, and Machine Learning. 1989, Reading, MA: Addison-Wesley.

    Google Scholar 

  23. Croce, F.D., R. Tadei, and G. Volta, A Genetic Algorithm for the Job Shop Problem. Computers in Operations Research, 1995. 22(1): p. 15–24.

    Google Scholar 

  24. Hou, E.S.H., N. Ansari, and H. Ren, A Genetic Algorithm for Multiprocessor Scheduling. IEEE Transactions on Parallel and Distributed Systems, 1994. 5(2): p. 113–120.

    Google Scholar 

  25. Reeves, C.R., A Genetic Algorithm for Flowshop Sequencing. Computers in Operations Research, 1995. 22(1): p. 5–13.

    Google Scholar 

  26. Glover, F., J.P. Kelly, and M. Laguna, Genetic Algorithms and Tabu Search: Hybrids for Optimization. Computers in Operations Research, 1995. 22(1): p. 111–134.

    Google Scholar 

  27. Glover, F. and M. Laguna, Tabu Search, in Modern Heuristic Techniques for Combinatorial Problems, C. Reeves, C. Reevess. 1993, Oxford

    Google Scholar 

  28. Chockalingam, T. and S. Arunkumar, Genetic Algorithm Based Heuristics for the Mapping Problem. Computers in Operations Research, 1995. 22(1): p. 55–64.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Dror G. Feitelson Larry Rudolph

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rosenkrantz, M.E., Schneider, D.J., Leibensperger, R., Shore, M., Zollweg, J. (1995). Requirements of the Cornell Theory Center for resource management and process scheduling. In: Feitelson, D.G., Rudolph, L. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP 1995. Lecture Notes in Computer Science, vol 949. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60153-8_36

Download citation

  • DOI: https://doi.org/10.1007/3-540-60153-8_36

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60153-1

  • Online ISBN: 978-3-540-49459-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics