You have Guest access.
Log In
Dror G. Feitelson, Larry Rudolph and Uwe Schwiegelshohn
Front matter
1-16
Parallel Job Scheduling — A Status Report
11-16
Scheduling on the Top 50 Machines
9-13
Parallel Computer Workload Modeling with Markov Chains
164-189
Enhancements to the Decision Process of the Self-Tuning dynP Scheduler
177-182
Reconfigurable Gang Scheduling Algorithm
9-15
Time-Critical Scheduling on a Well Utilised HPC System at ECMWF Using Loadleveler with Resource Reservation
92-163
Inferring the Topology and Traffic Load of Parallel Programs Running in a Virtual Machine Environment
39-50
Multi-toroidal Interconnects: Using Additional Communication Links to Improve Utilization of Parallel Computers
14-32
Costs and Benefits of Load Sharing in the Computational Grid
33-53
Workload Characteristics of a Multi-cluster Supercomputer
104-144
A Dynamic Co-allocation Service in Multicluster Systems
54-103
Exploiting Replication and Data Reuse to Efficiently Schedule Data-Intensive Applications on Grids
23-38
Performance Implications of Failures in Large-Scale Cluster Scheduling
253-263
Are User Runtime Estimates Inherently Inaccurate?
16-22
Improving Speedup and Response Times by Replicating Parallel Programs on a SNOW
51-91
LOMARC — Lookahead Matchmaking for Multi-resource Coscheduling
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info