My Account Log in

1 option

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

LIBRA Q341 .P7 2004
Loading location information...

Available from offsite location This item is stored in our repository but can be checked out.

Log in to request item
Format:
Book
Contributor:
Feitelson, Dror G., editor.
Rudolph, Larry, editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
Lecture notes in computer science 0302-9743 ; 1659.
Lecture Notes in Computer Science, 0302-9743 ; 1659
Language:
English
Subjects (All):
Operating systems (Computers).
Computer programming.
Computer architecture.
Algorithms.
Microprocessors.
Logic design.
Operating Systems.
Programming Techniques.
Computer System Implementation.
Algorithm Analysis and Problem Complexity.
Processor Architectures.
Logic Design.
Local Subjects:
Operating Systems.
Programming Techniques.
Computer System Implementation.
Algorithm Analysis and Problem Complexity.
Processor Architectures.
Logic Design.
Physical Description:
1 online resource (VIII, 244 pages).
Edition:
First edition 1999.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1999.
System Details:
text file PDF
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.
Other Format:
Printed edition:
ISBN:
978-3-540-47954-3
9783540479543
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account