Amortized efficiency of list update and paging rules
Communications of the ACM
Introduction to algorithms
Memory versus randomization in on-line algorithms
IBM Journal of Research and Development
Bandwidth allocation with preemption
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Efficient on-line call control algorithms
Journal of Algorithms
Online computation and competitive analysis
Online computation and competitive analysis
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Competitive non-preemptive call control
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Online scheduling with hard deadlines
Journal of Algorithms
Real-Time Systems: Design Principles for Distributed Embedded Applications
Real-Time Systems: Design Principles for Distributed Embedded Applications
Patience is a virtue: the effect of slack on competitiveness for admission control
Journal of Scheduling - Special issue: On-line algorithm part I
Competitive routing of virtual circuits in ATM networks
IEEE Journal on Selected Areas in Communications
A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts
Information Processing Letters
Online nonpreemptive scheduling of equal-length jobs on two identical machines
ACM Transactions on Algorithms (TALG)
Online scheduling of equal-length jobs on parallel machines
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Online preemptive scheduling with immediate decision or notification and penalties
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Online, non-preemptive scheduling of equal-length jobs on two identical machines
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Online scheduling with hard deadlines on parallel machines
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Dispatching equal-length jobs to parallel machines to maximize throughput
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Competitive analysis for make-to-order scheduling with reliable lead time quotation
Journal of Combinatorial Optimization
Online scheduling with preemption or non-completion penalties
Journal of Scheduling
Hi-index | 0.00 |
When admission control is used, an on-line scheduler chooses whether or not to complete each individual job successfully by its deadline. An important consideration is at what point in time the scheduler determines if a job request will be satisfied, and thus at what point the scheduler is able to provide notification to the job owner as to the fate of the request. In the loosest model, often seen in real-time systems, such a decision can be deferred up until the job's deadline passes. In the strictest model, more suitable for customer-based applications, a scheduler would be required to give notification at the instant that a job request arrives.Unfortunately there seems to be little existing research which explicitly studies the effect of the notification model on the performance guarantees of a scheduler. We undertake such a study by reexamining a problem from the literature. Specifically, we study the effect of the notification model on the non-preemptive scheduling of a single resource in order to maximize utilization. At first glance, it appears severely more restrictive to compare a scheduler required to give immediate notification to one which need not give any notification. Yet we are able to present alternate algorithms which provide immediate notification, while matching most of the performance guarantees which are possible by schedulers which provide no such notification. In only one case are we able to give evidence that providing immediate notification may be more difficult.