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.

Contributor(s): Feitelson, Dror G [editor.] | Rudolph, Larry [editor.] | SpringerLink (Online service)Material type: TextTextSeries: Lecture Notes in Computer Science ; 1659Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1999Description: VIII, 244 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540479543Subject(s): Computer science | Logic design | Operating systems (Computers) | Computer software | Computer Science | Operating Systems | Programming Techniques | Algorithm Analysis and Problem Complexity | Processor Architectures | Logic DesignAdditional physical formats: Printed edition:: No titleDDC classification: 005.43 LOC classification: QA76.76.O63Online resources: Click here to access online
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.
In: Springer eBooks
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library
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.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha