FEEDBACK Smiley face
Job Scheduling Strategies for Parallel Processing IPPS/SPDP’99Workshop, JSSPP’99 San Juan, Puerto Rico, April 16, 1999 Proceedings / [electronic resource] : edited by Dror G. Feitelson, Larry Rudolph. - VIII, 244 p. online resource. - Lecture Notes in Computer Science, 1659 0302-9743 ; . - Lecture Notes in Computer Science, 1659 .

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.


10.1007/3-540-47954-6 doi

Computer science.
Logic design.
Architecture, Computer.
Computer programming.
Operating systems (Computers).
Computer Science.
Operating Systems.
Programming Techniques.
Computer System Implementation.
Algorithm Analysis and Problem Complexity.
Processor Architectures.
Logic Design.



© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: