Preemptive scheduling on a small number of hierarchical machines
Authors:
- György DósaGDGyörgy Dósa
- Leah EpsteinLELeah Epstein
- 1 May 2008
- journal article
- Published by Elsevier in Information and Computation
- Vol. 206 (5) , 602-619
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Preemptive Online Scheduling: Optimal Algorithms for All Speeds2006
- On-line algorithms for the channel assignment problem in cellular networksDiscrete Applied Mathematics, 2004
- Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratiosOperations Research Letters, 2001
- Randomized on-line scheduling on two uniform machinesJournal of Scheduling, 2001
- On-Line Load Balancing in a Hierarchical Server TopologySIAM Journal on Computing, 2001
- On-Line Load Balancing for Related MachinesJournal of Algorithms, 2000
- On-line routing of virtual circuits with applications to load balancing and machine schedulingJournal of the ACM, 1997
- An optimal algorithm for preemptive on-line schedulingOperations Research Letters, 1995
- The Competitiveness of On-Line AssignmentsJournal of Algorithms, 1995
- A lower bound for randomized on-line scheduling algorithmsInformation Processing Letters, 1994