A Level Algorithm for Preemptive Scheduling
Journal of the ACM (JACM)
Preemptive Scheduling of Uniform Processor Systems
Journal of the ACM (JACM)
A New Algorithm for Preemptive Scheduling of Trees
Journal of the ACM (JACM)
Deterministic Processor Scheduling
ACM Computing Surveys (CSUR)
Analysis of a level algorithm for preemptive scheduling
SOSP '75 Proceedings of the fifth ACM symposium on Operating systems principles
The Impact of Performance Asymmetry in Emerging Multicore Architectures
Proceedings of the 32nd annual international symposium on Computer Architecture
Minimizing total completion time on uniform machines with deadline constraints
ACM Transactions on Algorithms (TALG)
Online scheduling on semi-related machines
Information Processing Letters
Optimal preemptive scheduling for general target functions
Journal of Computer and System Sciences
Preemptive scheduling on selfish machines
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Automating GPU computing in MATLAB
Proceedings of the international conference on Supercomputing
Robust algorithms for preemptive scheduling
ESA'11 Proceedings of the 19th European conference on Algorithms
Algorithms with limited number of preemptions for scheduling on parallel machines
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Algorithms with limited number of preemptions for scheduling on parallel machines
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
In this paper, the problem of optimal scheduling of independent tasks on heterogeneous computing systems is considered. Optimal scheduling algorithms which produce preemptive schedules with minimal completion times and non-preemptive schedules with minimal mean flow times are described. A bound on mean flow times also provides us with information concerning the relative merit of different multiprocessor systems.