Job Scheduling Strategies for Parallel Processing: IPPS/SPDP'99 Workshop, JSSPP'99, San Juan, Puerto Rico, April 16, 1999, Proceedings by Dror G. FeitelsonJob Scheduling Strategies for Parallel Processing: IPPS/SPDP'99 Workshop, JSSPP'99, San Juan, Puerto Rico, April 16, 1999, Proceedings by Dror G. Feitelson

Job Scheduling Strategies for Parallel Processing: IPPS/SPDP'99 Workshop, JSSPP'99, San Juan…

EditorDror G. Feitelson, Larry Rudolph

Paperback | October 13, 1999

Pricing and Purchase Info

$116.95

Earn 585 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

This book constitutes the thoroughly refereed post-workshop proceedings of the 5th International Workshop on Job Scheduling Strategies for Parallel Processing, JSSPP'99, held in San Juan, Puerto Rico, in April 1999, as a satelite meeting of IPPS/SPDP'99.The 12 revised full papers have been through an iterated reviewing process and present the state of the art in the area.
Title:Job Scheduling Strategies for Parallel Processing: IPPS/SPDP'99 Workshop, JSSPP'99, San Juan…Format:PaperbackDimensions:252 pagesPublished:October 13, 1999Publisher:Springer Berlin HeidelbergLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540666761

ISBN - 13:9783540666769

Look for similar items by category:

Reviews

Table of Contents

Scheduling for Parallel Supercomputing: A Historical Perspective of Achievable Utilization.- On the Design and Evaluation of Job Scheduling Algorithms.- Comparing Logs and Models of Parallel Workloads Using the Co-plot Method.- Benchmarks and Standards for the Evaluation of Parallel Job Schedulers.- The Effect of Correlating Quantum Allocation and Job Size for Gang Scheduling.- Scheduling on AP/Linux for Fine and Coarse Grain Parallel Processes.- Job Re-packing for Enhancing the Performance of Gang Scheduling.- Process Tracking for Parallel Job Control.- The Legion Resource Management System.- Scheduling a Metacomputer with Uncooperative Sub-schedulers.- Using Run-Time Predictions to Estimate Queue Wait Times and Improve Scheduler Performance.- Deterministic Batch Scheduling without Static Partitioning.