• D. G. Feitelson, A Survey of Scheduling in Multiprogrammed Parallel Systems. Research Report RC 19790 (87657), IBM T. J. Watson Research Center, Oct 1994.
  Revised version from August 1997 (388 KB), or shorter version (245 KB).
• D. G. Feitelson and L. Rudolph, ``Job scheduling for parallel supercomputers''. In Encyclopedia of Computer Science and Technology, A. Kent and J. G. Williams (Eds.), Vol. 38, pp. 287-314, Marcel Dekker, Inc., 1998.
  Largely based on
  • D. G. Feitelson and L. Rudolph, ``Parallel job scheduling: issues and approaches''. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (Eds.), pp. 1-18, Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949. (57 KB)
  • D. G. Feitelson and L. Rudolph, ``Toward convergence in job schedulers for parallel supercomputers''. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (Eds.), pp. 1-26, Springer-Verlag, 1996. Lecture Notes in Computer Science Vol. 1162. (75 KB)
• D. G. Feitelson, L. Rudolph, U. Schweigelshohn, K. Sevcik, and P. Wong, ``Theory and practice in parallel job scheduling''. In Job Scheduling Strategies for Parallel Processing D. G. Feitelson and L. Rudolph (Eds.), pp. 1-34, Springer-Verlag, 1997. Lecture Notes in Computer Science Vol. 1291. (95 KB)
• D. G. Feitelson and L. Rudolph, ``Distributed hierarchical control for parallel processing''. Computer 23(5), pp. 65-77, May 1990.
  ©Copyright 1990 by IEEE. Definitive version available from the IEEE Computer Society Digital Library.
• D. G. Feitelson and L. Rudolph, ``Gang scheduling performance benefits for fine-grain synchronization''. J. Parallel & Distributed Comput. 16(4), pp. 306-318, Dec 1992. (109 KB)
  ©Copyright 1992 by Academic Press.
• D. G. Feitelson and L. Rudolph, ``Coscheduling based on run-time identification of activity working sets''. Intl. J. Parallel Programming 23(2), pp. 135-160, Apr 1995. (79 KB)
• D. G. Feitelson and L. Rudolph, ``Evaluation of design choices for gang scheduling using distributd hierarchical control''. J. Parallel & Distributed Comput. 35(1), pp. 18-34, May 1996.
  ©Copyright 1996 by Academic Press. Definitive version available from Science Direct.
  Largely based on
  • D. G. Feitelson and L. Rudolph, ``Mapping and scheduling in a shared parallel environment using distributed hierarchical control''. In Int'l Conf. Parallel Processing, vol. I, pp. 1-8, Aug 1990.
  • D. G. Feitelson and L. Rudolph, ``Wasted resources in gang scheduling''. In 5th Jerusalem Conf. Information Technology, pp. 127-136, IEEE Computer Society Press, Oct 1990.
  • D. G. Feitelson and L. Rudolph, ``Metrics and benchmarking for parallel job scheduling''. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (Eds.), pp. 1-24, Springer-Verlag, 1998. Lecture Notes in Computer Science Vol. 1459.
    ©Copyright 1998 by Springer-Verlag. Definitive version available from Springer LINK.