Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456
CALL FOR PAPERS Workshop on Job Scheduling Strategies for Parallel Processing ============================================================= in conjunction with IPPS '95, April 25, 1995 Red Lion Resort, Santa Barbara, California SCOPE: 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. 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. TOPICS AND ISSUES: - Experience with scheduling policies on current systems - Performance implications of scheduling strategies - Fairness, priorities, and accounting issues - Workload characterization and classification - Support for different classes of jobs (e.g. interactive vs. batch) - Static vs. dynamic partitioning - Time slicing and gang scheduling - Scheduling to support a specific model of computation - Interaction of scheduling with memory management and I/O 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. Send 6 copies of the paper to: Dror Feitelson IBM T J Watson Research Center P O Box 218 Yorktown Heights, NY 10598 Please include name, address, phone, and email of contact author. * DEADLINE FOR SUBMISSION: February 1, 1995 * AUTHOR NOTIFICATION: March 15, 1995 * FINAL COPY DUE: April 3, 1995 REGISTRATION: The workshop is open to all participants of IPPS '95. For general IPPS '95 information, contact ipps95@halcyon.usc.edu. ORGANIZERS: Dror Feitelson, IBM Research (feit@watson.ibm.com) Larry Rudolph, Hebrew University (rudolph@lcs.mit.edu) PROGRAM COMMITTEE: David Black, OSF Jim Cownie, Meiko Dror Feitelson, IBM Research (Co-Chairman) Allan Gottlieb, New York University Mal Kalos, Cornell Theory Center Bradley C. Kuszmaul, MIT Miron Livny, University of Wisconsin Virginia Lo, University of Oregon Reagan Moore, SDSC Larry Rudolph, Hebrew University (Co-Chairman) Mark Squillante, IBM Research Bernard Traversat, NASA Ames John Zahorjan, University of Washington