Amortized efficiency of list update and paging rules
Communications of the ACM
Operating system concepts (3rd ed.)
Operating system concepts (3rd ed.)
On-line scheduling in the presence of overload
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Operating systems: concepts and design
Operating systems: concepts and design
On the competitiveness of on-line real-time task scheduling
Real-Time Systems
MOCA: a multiprocessor on-line competitive algorithm for real-time system scheduling
Theoretical Computer Science - Special issue on dependable parallel computing
On-line scheduling of jobs with fixed start and end times
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Approximation algorithms for scheduling
Approximation algorithms for NP-hard problems
Optimal time-critical scheduling via resource augmentation (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Scheduling for Overload in Real-Time Systems
IEEE Transactions on Computers
Online computation and competitive analysis
Online computation and competitive analysis
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Page replacement for general caching problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Trade-offs between speed and processor in hard-deadline scheduling
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling Algorithms
Speed is More Powerful than Claivoyance
SWAT '98 Proceedings of the 6th Scandinavian Workshop on Algorithm Theory
Competitive Analysis of the Round Robin Algorithm
ISAAC '92 Proceedings of the Third International Symposium on Algorithms and Computation
Developments from a June 1996 seminar on Online algorithms: the state of the art
The Online Transportation Problem
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Fault-Tolerant Real-Time Scheduling
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Minimizing flow time nonclairvoyantly
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Jitter Control in QoS Networks
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Journal of the ACM (JACM)
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Broadcast scheduling: when fairness is fine
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Extra processors versus future information in optimal deadline scheduling
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Online deadline scheduling on faster machines
Information Processing Letters
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On the speed requirement for optimal deadline scheduling in overloaded systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
On-Line Scheduling with Tight Deadlines
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Preemptive Scheduling in Overloaded Systems
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Non-clairvoyant Scheduling for Minimizing Mean Slowdown
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Minimizing the Maximum Starting Time On-line
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A Comparison of Multicast Pull Models
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
On-line scheduling with tight deadlines
Theoretical Computer Science - Mathematical foundations of computer science
TCP is competitive against a limited adversary
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Server scheduling in the Lp norm: a rising tide lifts all boat
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Minimizing flow time nonclairvoyantly
Journal of the ACM (JACM)
Non-clairvoyant scheduling for weighted flow time
Information Processing Letters
Preemptive scheduling in overloaded systems
Journal of Computer and System Sciences
Maximizing job completions online
Journal of Algorithms
SRPT optimally utilizes faster machines to minimize flow time
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A maiden analysis of Longest Wait First
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Non-migratory online deadline scheduling on multiprocessors
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Mechanism design for online real-time scheduling
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Multi-processor scheduling to minimize flow time with ε resource augmentation
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Patience is a virtue: the effect of slack on competitiveness for admission control
Journal of Scheduling - Special issue: On-line algorithm part I
Competitive deadline scheduling via additional or faster processors
Journal of Scheduling - Special issue: On-line algorithm part I
Performance guarantee for EDF under overload
Journal of Algorithms
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Improved competitive algorithms for online scheduling with partial job values
Theoretical Computer Science - Special papers from: COCOON 2003
Algorithmic problems in power management
ACM SIGACT News
The relative worst order ratio applied to paging
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Quorum placement in networks to minimize access delays
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
A maiden analysis of longest wait first
ACM Transactions on Algorithms (TALG)
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Optimal on-line flow time with resource augmentation
Discrete Applied Mathematics - Special issue: Efficient algorithms
Reconfigurable resource scheduling
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling
Theoretical Computer Science
Topology matters: smoothed competitiveness of metrical task systems
Theoretical Computer Science
Utilization of nonclairvoyant online schedules
Theoretical Computer Science
The relative worst-order ratio applied to paging
Journal of Computer and System Sciences
Competitive online scheduling for server systems
ACM SIGMETRICS Performance Evaluation Review
Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm
Mathematics of Operations Research
ACM Transactions on Algorithms (TALG)
Non-clairvoyant scheduling with precedence constraints
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Stochastic analyses for online combinatorial optimization problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Competitive analysis of most-request-first for scheduling broadcasts with start-up delay
Theoretical Computer Science
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
The Distributed Wireless Gathering Problem
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
SRPT optimally utilizes faster machines to minimize flow time
ACM Transactions on Algorithms (TALG)
Online unit clustering: Variations on a theme
Theoretical Computer Science
Theoretical Computer Science
Optimal Resource Augmentations for Online Knapsack
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Theoretical Computer Science
Scalably scheduling processes with arbitrary speedup curves
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Online scheduling to minimize the maximum delay factor
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Minimizing Average Flow Time in Sensor Data Gathering
Algorithmic Aspects of Wireless Sensor Networks
Increasing Machine Speed in On-Line Scheduling of Weighted Unit-Length Jobs in Slotted Time
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Resource augmented semi-online bounded space bin packing
Discrete Applied Mathematics
Speed scaling of processes with arbitrary speedup curves on a multiprocessor
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Online Tree Node Assignment with Resource Augmentation
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
SIGACT news online algorithms column 14
ACM SIGACT News
Optimal on-line flow time with resource augmentation
Discrete Applied Mathematics - Special issue: Efficient algorithms
Minimizing the maximum starting time on-line
Information and Computation
Improved competitive algorithms for online scheduling with partial job values
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Non-clairvoyant batch sets scheduling: fairness is fair enough
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Tight results for Next Fit and Worst Fit with resource augmentation
Theoretical Computer Science
Scheduling jobs with varying parallelizability to reduce variance
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Virtual appliance content distribution for a global infrastructure cloud service
INFOCOM'10 Proceedings of the 29th conference on Information communications
Online knapsack with resource augmentation
Information Processing Letters
An online scalable algorithm for average flow time in broadcast scheduling
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and complexity for periodic real-time scheduling
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Better scalable algorithms for broadcast scheduling
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Scheduling real-time mixed-criticality jobs
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
How to schedule when you have to buy your energy
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
The distributed wireless gathering problem
Theoretical Computer Science
New models and algorithms for throughput maximization in broadcast scheduling
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Minimizing maximum flowtime of jobs with arbitrary parallelizability
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
SIAM Journal on Computing
Minimizing flow time in the wireless gathering problem
ACM Transactions on Algorithms (TALG)
On scheduling in map-reduce and flow-shops
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Meeting deadlines: how much speed suffices?
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
(1 + ε)-competitive algorithm for online OVSF code assignment with resource augmentation
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Optimal online algorithms on two hierarchical machines with resource augmentation
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Online tree node assignment with resource augmentation
Journal of Combinatorial Optimization
Mixed-criticality scheduling of sporadic task systems
ESA'11 Proceedings of the 19th European conference on Algorithms
Scheduling heterogeneous processors isn't as easy as you think
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Online scheduling with general cost functions
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Laxity helps in broadcast scheduling
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
An online scalable algorithm for minimizing lk-norms of weighted flow time on unrelated machines
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Online scalable scheduling for the lk-norms of flow time without conservation of work
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Online scheduling on identical machines using SRPT
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Online bin packing with resource augmentation
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Optimal buffer management via resource augmentation
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Optimizing the stretch of independent tasks on a cluster: From sequential tasks to moldable tasks
Journal of Parallel and Distributed Computing
Longest wait first for broadcast scheduling [extended abstract]
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Online scheduling of bounded length jobs to maximize throughput
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Competitive multi-dimensional dynamic bin packing via l-shape bin packing
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Online k-server routing problems
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Oblivious medians via online bidding
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Scalably scheduling processes with arbitrary speedup curves
ACM Transactions on Algorithms (TALG)
Non-clairvoyant weighted flow time scheduling on different multi-processor models
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
On the advice complexity of the knapsack problem
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Greedy multiprocessor server scheduling
Operations Research Letters
Online bin packing with resource augmentation
Discrete Optimization
Non-clairvoyant weighted flow time scheduling with rejection penalty
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
An online scalable algorithm for average flow time in broadcast scheduling
ACM Transactions on Algorithms (TALG)
Access graphs results for LRU versus FIFO under relative worst order analysis
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Proceedings of the tenth ACM international conference on Embedded software
Online scheduling of bounded length jobs to maximize throughput
Journal of Scheduling
Algorithms and complexity for periodic real-time scheduling
ACM Transactions on Algorithms (TALG)
Resource augmentation for fault-tolerance feasibility of real-time tasks under error bursts
Proceedings of the 20th International Conference on Real-Time and Network Systems
Competitive algorithms for due date scheduling
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
On the competitiveness of AIMD-TCP within a general network
Theoretical Computer Science
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
A bicriteria approximation for the reordering buffer problem
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Shortest-Elapsed-Time-First on a multiprocessor
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Partitioning sporadic task systems upon memory-constrained multiprocessors
ACM Transactions on Embedded Computing Systems (TECS)
Brief announcement: online batch scheduling for flow objectives
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Reallocation problems in scheduling
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Recent advances for a classical scheduling problem
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Coordination mechanisms from (almost) all scheduling policies
Proceedings of the 5th conference on Innovations in theoretical computer science
Partitioned EDF scheduling: a closer look
Real-Time Systems
Competitive online adaptive scheduling for sets of parallel jobs with fairness and efficiency
Journal of Parallel and Distributed Computing
Journal of Combinatorial Optimization
(1+ε)-competitive algorithm for online OVSF code assignment with resource augmentation
Journal of Combinatorial Optimization
Mixed-criticality scheduling on multiprocessors
Real-Time Systems
| Hi-index | 0.01 |
We introduce resource augmentation as a method for analyzing online scheduling problems. In resource augmentation analysis the on-line scheduler is given more resources, say faster processors or more processors, than the adversary. We apply this analysis to two well-known on-line scheduling problems, the classic uniprocessor CPU scheduling problem 1 |ri, pmtn|&Sgr; Fi, and the best-effort firm real-time scheduling problem 1|ri, pmtn| &Sgr; wi( 1- Ui). It is known that there are no constant competitive nonclairvoyant on-line algorithms for these problems. We show that there are simple on-line scheduling algorithms for these problems that are constant competitive if the online scheduler is equipped with a slightly faster processor than the adversary. Thus, a moderate increase in processor speed effectively gives the on-line scheduler the power of clairvoyance. Furthermore, the on-line scheduler can be constant competitive on all inputs that are not closely correlated with processor speed. We also show that the performance of an on-line scheduler is best-effort real time scheduling can be significantly improved if the system is designed in such a way that the laxity of every job is proportional to its length.