JSSPP 1997: Geneva, Switzerland
Dror G. Feitelson, Larry Rudolph (Eds.): Job Scheduling Strategies for Parallel Processing, IPPS'97 Workshop, Geneva, Switzerland, April 5, 1997, Proceedings. Springer 1997 Lecture Notes in Computer Science ISBN 3-540-63574-2- Dror G. Feitelson, Larry Rudolph, Uwe Schwiegelshohn, Kenneth C. Sevcik, Parkson Wong: Theory and Practice in Parallel Job Scheduling. 1-34
- Allen B. Downey: Using Queue Time Predictions for Processor Allocation. 35-57
- Richard Gibbons: A Historical Application Profiler for Use by Parallel Schedulers. 58-77
- Dror G. Feitelson: Memory Usage in the LANL CM-5 Workload. 78-94
- Joefon Jann, Pratap Pattnaik, Hubertus Franke, Fang Wang, Joseph Skovira, Joseph Riordan: Modeling of Workload in MPPs. 95-116
- Tim Brecht: An Experimental Evaluation of Processor Pool-Based Scheduling for Shared-Memory NUMA Multiprocessors. 139-165
- Pham Hong Hanh, Valery Simonenko: Objective-Oriented Algorithm for Job Scheduling in Parallel Heterogeneous Systems. 193-214
- Walter Lee, Matthew Frank, Victor Lee, Kenneth Mackenzie, Larry Rudolph: Implications of I/O for Gang Scheduled Workloads. 215-237
- Dror G. Feitelson, Morris A. Jette: Improved Utilization and Responsiveness with Gang Scheduling. 238-261
- Atsushi Hori, Hiroshi Tezuka, Yutaka Ishikawa: Global State Detection Using Network Preemption. 262-276
- Fang Wang, Marios C. Papaefthymiou, Mark S. Squillante: Performance Evaluation of Gang Scheduling for Parallel and Distributed Multiprogramming. 277-298
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team