Job Scheduling Strategies for Parallel Processing: IPPS '97 Workshop, Geneva, Switzerland, April 5, 1997, Proceedings, Volume 3
Springer Science & Business Media, Aug 27, 1997 - Computers - 298 pages
This book constitutes the strictly refereed post-workshop proceedings of the 1997 IPPS Workshop on Job Scheduling Strategies for Parallel Processing held in Geneva, Switzerland, in April 1997, as a satelite meeting of the IEEE/CS International Parallel Processing Symposium.
The 12 revised full papers presented were carefully reviewed and revised for inclusion in the book. Also included is a detailed introduction surveying the state of the art in the area. Among the topics covered are processor allocation, parallel scheduling, massively parallel processing, shared-memory architectures, gang scheduling, etc.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Theory and Practice in Parallel Job Scheduling
Using Queue Time Predictions for Processor Allocation
A Historical Application Profiler for Use by Parallel Schedulers
Memory Usage in the LANL CM5 Workload
Modeling of Workload in MPPs
Political Scheduling on the CRAY T3E
An Experimental Evaluation of Processor PoolBased Scheduling for SharedMemory NUMA Multiprocessors
Implementing Multiprocessor Scheduling Disciplines
ObjectiveOriented Algorithm for Job Scheduling in Parallel Heterogeneous Systems
Implications of IO for Gang Scheduled Workloads
Improved Utilization and Responsiveness with Gang Scheduling
Global State Detection Using Network Preemption
Performance Evaluation of Gang Scheduling for Parallel and Distributed Multiprogramming
assigned average batch cluster compute-bound jobs Computer Science Vol Computer Systems configured Cornell Theory Center CRAY T3E D. G. Feitelson domain EASY-LL environment Erlang distribution Evaluation execution exponential distribution gang scheduling gangedness global Historical Profiler Hyper Erlang I/O-bound job idle implemented improve interactive Job Scheduling Strategies Lecture Notes Load Balancing Load Sharing Facility machine malleable mean response memory usage migration Modeling of Computer multiprocessor multiprocessor scheduling multiprogrammed Myrinet nodes Notes in Computer number of jobs number of processors operating system optimization overhead parallel applications parallel computers parallel jobs Parallel Processing parameters partition performance placement predictions preempted preemption priority inversion problem Proceedings processor allocation processor pools PScheD queue request requirements Rudolph eds runtime scheduling disciplines scheduling policies SCore-D Section Sevcik shared-memory SIGMETRICS simulation slowdown speedup Springer-Verlag Strategies for Parallel supercomputing threads time-slice Timeplexing Cycle utilization workload