Job Scheduling Strategies for Parallel Processing [electronic resource] : IPPS/SPDP’99Workshop, JSSPP’99 San Juan, Puerto Rico, April 16, 1999 Proceedings / edited by Dror G. Feitelson, Larry Rudolph.
Material type:
TextSeries: Lecture Notes in Computer Science ; 1659Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1999Description: VIII, 244 p. online resourceContent type: - text
- computer
- online resource
- 9783540479543
- 005.43 23
- QA76.76.O63
E-BOOKS
| Home library | Call number | Materials specified | URL | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|
| IMSc Library | Link to resource | Available | EBK6247 |
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.
There are no comments on this title.