Titlebook: Job Scheduling Strategies for Parallel Processing; IPPS ‘97 Workshop, G Dror G. Feitelson,Larry Rudolph Conference proceedings 1997 Springe

撤退

Walter Lee,Matthew Frank,Victor Lee,Kenneth Mackenzie,Larry Rudolph

plasma-cells

無可爭(zhēng)辯

Implications of I/O for gang scheduled workloads,we show that messaging statistics contain information about whether applications require gang scheduling. Taken together these results provide evidence that flexible gang scheduling is both necessary and feasible.

GEN

過時(shí)

提名的名單

Using queue time predictions for processor allocation, in queue for more processors to become available. To make this decision, it must predict how long it will have to wait for the larger cluster. We propose statistical techniques for predicting these queue times, and develop an allocation strategy that uses these predictions. We present a workload mo

使饑餓

A historical application profiler for use by parallel schedulers,han algorithms that do not. This paper focuses on obtaining such information for use by a scheduler in a network of workstations environment..The log files from three parallel systems are examined to determine both how to categorize parallel jobs for storage in a job database and what job informatio

分開

隱藏

浪蕩子