This paper presents a performance analysis of market-based batch schedulers for clusters of
workstations. In contrast to previous work, we use user-centric performance metrics as the …

As supercomputing resources become more available, users will require resources
managed by several local schedulers. To gain access to a collection of resources, current …

In most parallel supercomputers, submitting a job for execution involves specifying (i) how
many processors are to be allocated to the job, and (ii) for how long these processors are to …

There are many choices to make when evaluating the performance of a complex system. In
the context of parallel job scheduling, one must decide what workload to use and what …

A workload characteristic on a parallel computer depends on an administration policy or a
user community for the computer system. An administrator of a parallel computer system …

Backfill is a technique in which lower priority jobs requiring fewer resources are initiated
before one or more currently waiting higher priority jobs requiring as yet unavailable …

This paper proposes extensions to the backfilling job-scheduling algorithm that significantly
improve its performance. We introduce variations that sort the" backfilling order" in priority …

In this paper, we show how application scheduling can be used to reduce the turn-around
time of supercomputer jobs. Our approach focuses on the use of SA, an AppLeS application …

We analyze a parallel system with two identical servers and pure space sharing among rigid
jobs. The parallel system is modelled as an M/M/2 queue with two types of jobs. Jobs of one …

In systems consisting of multiple clusters of processors which are interconnected by
relatively slow communication links and which employ space sharing for scheduling jobs …