Job Scheduling Strategies for Parallel Processing: IPPS '97 Workshop, Geneva, Switzerland, April 5, 1997, ProceedingsSpringer Science & Business Media, 1997. gada 27. aug. - 298 lappuses 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. |
Saturs
Theory and Practice in Parallel Job Scheduling | 1 |
Using Queue Time Predictions for Processor Allocation | 35 |
A Historical Application Profiler for Use by Parallel Schedulers | 58 |
Memory Usage in the LANL CM5 Workload | 78 |
Modeling of Workload in MPPs | 95 |
Political Scheduling on the CRAY T3E | 117 |
An Experimental Evaluation of Processor PoolBased Scheduling for SharedMemory NUMA Multiprocessors | 139 |
Implementing Multiprocessor Scheduling Disciplines | 166 |
ObjectiveOriented Algorithm for Job Scheduling in Parallel Heterogeneous Systems | 193 |
Implications of IO for Gang Scheduled Workloads | 215 |
Improved Utilization and Responsiveness with Gang Scheduling | 238 |
Global State Detection Using Network Preemption | 262 |
Performance Evaluation of Gang Scheduling for Parallel and Distributed Multiprogramming | 277 |
Author Index | |
Bieži izmantoti vārdi un frāzes
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 predictions preempted preemption priority inversion problem Proceedings processor allocation processor pools PScheD push-down queue request requirements round-robin Rudolph eds runtime scheduling disciplines scheduling policies SCore-D Section Sevcik shared-memory simulation slowdown speedup Springer-Verlag Strategies for Parallel supercomputing takeaway thread time-slice Timeplexing Cycle utilization workload