2008 46th Annual Allerton Conference on Communication, Control, and Computing 2008
DOI: 10.1109/allerton.2008.4797599
|View full text |Cite
|
Sign up to set email alerts
|

Asymptotic performance of the non-forced idle time scheduling policies in the presence of variable demand for resources

Abstract: A fundamental scheduling problem is to schedule a set of jobs on a set of machines so that as many jobs as possible can be scheduled while respecting the resource constraints on each machine. A further complication in many computer systems is that scheduling decisions must be made on-line, that is, as soon as job arrives it must either be scheduled or rejected. Many practical systems and algorithms schedule jobs in such a way that loads on machines tend to be balanced. However, in case when job requests are hi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 11 publications
(7 reference statements)
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?