2nd Workshop on Job Scheduling Strategies for Parallel Processing ================================================================= In conjunction with IPPS '96, April 16, 1996 Sheraton Waikiki Hotel, Honolulu, Hawaii CALL FOR PARTICIPATION: As large parallel computers become more popular, scheduling strategies become more important as a means of balancing the need for exclusive use of the machine's resources and the desire to make these resources readily available to many diverse users. Neither sign-up sheets, naive time-slicing, nor naive space-slicing are suitable solutions. Moreover, there appears to be a divergence between what is studied, modeled, and analyzed in academic circles and the actual, sometimes ad-hoc, scheduling schemes developed by vendors and large installations. Continuing the tradition established at IPPS'95, the workshop is intended to attract people from academia, supercomputing centers, national laboratories, and parallel computer vendors to address resource management issues in multiuser parallel systems, and attempt to resolve the conflicting goals such as short response times for interactive work, minimal interference with batch jobs, fairness to all users, and high system utilization. We hope to achieve a balance between reports of current practices in large and heavily-used installations, proposals of novel schemes that have not yet been tested in a real environment, and realistic models and analysis. The emphasis will be on practical designs in the context of real parallel operating systems. One session will be held jointly with the Heterogeneous Computing Workshop. Papers presented during this joint session will target the scheduling of parallel applications on distributed and heterogeneous systems of resources. TOPICS OF INTEREST INCLUDE: * Experience with actual scheduling policies * Performance implications of scheduling strategies * Fairness, priorities, and accounting issues * Workload characterization and classification * Support for various job classes * Static vs. dynamic partitioning * Time slicing, gang, or co-scheduling * Scheduling with computational model * Scheduling with Memory Management and I/O * Load estimation and load balancing * Scheduling on heterogeneous nodes * Performance metrics to compare scheduling schemes REGISTRATION: The workshop is open to participants of IPPS '96. (IPPS general contact: ipps96@halcyon.usc.edu) ORGANIZERS: Dror Feitelson, Hebrew University (feit@cs.huji.ac.il) Larry Rudolph, Hebrew University & MIT (rudolph@theory.lcs.mit.edu) PROGRAM COMMITTEE: Nawaf Bitar, Silicon Graphics David Black, OSF Jim Cownie, Meiko Allan Gottlieb, NYU Scott Hahn, Intel Mal Kalos, Cornell Theory Center Phil Krueger, Sequent Miron Livny, University of Wisconsin Virginia Lo, University of Oregon Reagan Moore, SDSC Ken Sevcik, University of Toronto Charlie Smith, Cray Research Mark Squillante, IBM Research Bernard Traversat, NASA Ames John Zahorjan, University of Washington SUBMISSIONS: Papers should be no longer than 20 pages, including figures and references. All papers will be reviewed, and a proceedings will be distributed at the workshop. Indicate suitability for joint session. Please include name, address, phone, and email of contact author. Send postscript of the paper by e-mail to: rudolph@theory.lcs.mit.edu or 6 hard copies of the paper to: Larry Rudolph MIT Lab for Computer Science 545 Technology Square Cambridge, MA 02139 IMPORTANT DATES: SUBMISSION DEADLINE: January 12, 1996 NOTIFICATION: February 26, 1996 FINAL COPY DUE: March 22, 1996 WORKSHOP: April 16, 1996 Web Pointer for IPPS Conference: http://cwis.usc.edu/dept/ceng/prasanna/meetings/ipps/ippshome.html Web Pointer for Workshop (basically same as this text version): http://theory.lcs.mit.edu:80/~rudolph/cfp-95-1.html