Job Scheduling Strategies for Parallel Processing: IPPS '96 Workshop, Honolulu, Hawaii, April 16, 1996. Proceedings
Springer Science & Business Media, Oct 16, 1996 - Computers - 289 pages
This book constitutes the strictly refereed post-workshop proceedings of the International Workshop on Job Scheduling Strategies for Parallel Processing, held in conjunction with IPPS '96 symposium in Honolulu, Hawaii, in April 1996.
The book presents 15 thoroughly revised full papers accepted for inclusion on the basis of the reports of at least five program committee members. The volume is a highly competent contribution to advancing the state-of-the-art in the area of job scheduling for parallel supercomputers. Among the topics addressed are job scheduler, workload evolution, gang scheduling, multiprocessor scheduling, parallel processor allocation, and distributed memory environments.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Toward Convergence in Job Schedulers for Parallel Supercomputers
Workload Evolution on the Cornell Theory Center IBM SP2
The EASY LoadLeveler API Project
A Batch Scheduler for the Intel Paragon with a Noncontiguous Node Allocation Algorithm
ArchitectureIndependent RequestScheduling with Tight WaitingTime Estimations
Packing Schemes for Gang Scheduling
A Gang Scheduling Design for Multiprogrammed Parallel Computing Environments
Implementation of GangScheduling on Workstation Cluster
Using Runtime Measured Workload Characteristics in Parallel Processor Scheduling
Parallel Application Characterization for Multiprocessor Scheduling Policy Design
Dynamic vs Static QuantumBased Parallel Processor Allocation
An Empirical Comparison
Dynamic Partitioning in Different DistributedMemory Environments
LocalityInformationBased Scheduling in SharedMemory Multiprocessors
Managing Checkpoints for Parallel Programs
algorithm architecture Arrival Rate jobs/second batch scheduler buddy cache misses characteristics checkpoint servers CoCheck Computer Science Computer Systems context switch Cornell Theory Center cost D. G. Feitelson Distributed Computing dynamic partitioning environment EQS-PWS execution FDDI Figure Folding gang scheduling implemented Intel Paragon job arrival Job Scheduling Strategies LoadLeveler machine memory mp3d MPGH multiprocessor Multiprocessor Scheduling multiprogrammed Myrinet node allocation node set number of jobs number of nodes number of processors operating system Paragon parallel applications parallel computers parallel job Parallel Processing parallel programs parallel systems performance phase-type distributions preemption Proceedings processor allocation quantum length queue reallocation reconfiguration repartitioning overheads request requirements response Rudolph eds running jobs runtime measurements scheduling policies scheme SCore-D Section shared-memory slots speedup speedup curves speedup function ST-EQUI Strategies for Parallel Supercomputer synchronization synthetic workload thread throughput utilization wait waiting-time Zahorjan