1995
DOI: 10.1007/3-540-60153-8_35
|View full text |Cite
|
Sign up to set email alerts
|

The ANL/IBM SP scheduling system

Abstract: 2/1/95 A bstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
217
0
2

Year Published

1999
1999
2015
2015

Publication Types

Select...
4
4
2

Relationship

0
10

Authors

Journals

citations
Cited by 369 publications
(223 citation statements)
references
References 1 publication
1
217
0
2
Order By: Relevance
“…The exact queueing algorithm is EASY backfilling [16] with the modification that large jobs are always moved ahead of small ones upon entering the queue.…”
Section: Prototype Symbiotic Schedulermentioning
confidence: 99%
“…The exact queueing algorithm is EASY backfilling [16] with the modification that large jobs are always moved ahead of small ones upon entering the queue.…”
Section: Prototype Symbiotic Schedulermentioning
confidence: 99%
“…Such systems often require their users to provide estimates of job runtimes. These estimates are used by the system scheduler to plan ahead and to decide when to run each job [442,506]. The naive expectation is that users would be motivated to provide accurate estimates in order to facilitate better system performance.…”
Section: Runtime Estimatesmentioning
confidence: 99%
“…The local resource system usually optimizes the reservation details, e.g. by using a backfilling algorithm [15]. The result are fixed start-and end-times for the job.…”
Section: The Architecture Of Calanamentioning
confidence: 99%