JSSPP 1998: Orlando, Florida, USA
Dror G. Feitelson, Larry Rudolph (Eds.): Job Scheduling Strategies for Parallel Processing, IPPS/SPDP'98 Workshop, Orlando, Florida, USA, March 30, 1998, Proceedings. Springer 1998 Lecture Notes in Computer Science ISBN 3-540-64825-9- Virginia Mary Lo, Jens Mache, Kurt J. Windisch: A Comparative Study of Real Workload Traces and Synthetic Workload Models for Parallel Job Scheduling. 25-46
- Allen B. Downey: Lachesis: A Job Scheduler for the Cray T3E. 47-61
- Karl Czajkowski, Ian T. Foster, Nicholas T. Karonis, Carl Kesselman, Stuart Martin, Warren Smith, Steven Tuecke: A Resource Management Architecture for Metacomputing Systems. 62-82
- Kuniyasu Suzaki, David Walsh: Implementing the Combination of Time Sharing and Space Sharing on AP/Linux. 83-97
- Kento Aida, Hironori Kasahara, Seinosuke Narita: Job Scheduling Scheme for Pure Space Sharing Among Rigid Jobs. 98-121
- Warren Smith, Ian T. Foster, Valerie E. Taylor: Predicting Application Run Times Using Historical Information. 122-142
- Bing Bing Zhou, Richard P. Brent, David Walsh, Kuniyasu Suzaki: Job Scheduling Strategies for Networks of Workstations. 143-157
- Sissades Tongsima, Chantana Chantrapornchai, Edwin Hsing-Mean Sha: Probabilistic Loop Scheduling Considering Communication Overhead. 158-179
- Uwe Schwiegelshohn, Ramin Yahyapour: Improving First-Come-First-Serve Job Scheduling by Gang Scheduling. 180-198
- Morris A. Jette: Expanding Symmetric Multiprocessor Capability Through Gang Scheduling. 199-216
- Atsushi Hori, Hiroshi Tezuka, Yutaka Ishikawa: Overhead Analysis of Preemptive Gang Scheduling. 217-230
- Patrick Sobalvarro, Scott Pakin, William E. Weihl, Andrew A. Chien: Dynamic Coscheduling on Workstation Clusters. 231-256
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team