Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Speed is as powerful as clairvoyance
Journal of the ACM (JACM)
Single-ISA Heterogeneous Multi-Core Architectures for Multithreaded Workload Performance
Proceedings of the 31st annual international symposium on Computer architecture
Performance, Power Efficiency and Scalability of Asymmetric Cluster Chip Multiprocessors
IEEE Computer Architecture Letters
Core architecture optimization for heterogeneous chip multiprocessors
Proceedings of the 15th international conference on Parallel architectures and compilation techniques
SRPT optimally utilizes faster machines to minimize flow time
ACM Transactions on Algorithms (TALG)
Scalably scheduling processes with arbitrary speedup curves
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Speed scaling with an arbitrary power function
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Proceedings of the forty-first annual ACM symposium on Theory of computing
Optimality, fairness, and robustness in speed scaling designs
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Scalably scheduling power-heterogeneous processors
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Better scalable algorithms for broadcast scheduling
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Non-clairvoyant speed scaling for weighted flow time
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Speed Scaling for Weighted Flow Time
SIAM Journal on Computing
Nonclairvoyantly scheduling power-heterogeneous processors
GREENCOMP '10 Proceedings of the International Conference on Green Computing
Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
SIAM Journal on Computing
Online scheduling on identical machines using SRPT
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Shortest-Elapsed-Time-First on a multiprocessor
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Nonclairvoyant sleep management and flow-time scheduling on multiple processors
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Energy-Efficient scheduling with time and processors eligibility restrictions
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
| Hi-index | 0.00 |
We consider preemptive online scheduling algorithms to minimize the total weighted/unweighted flow time plus energy for speed-scalable heterogeneous multiprocessors. We show that the well-known priority scheduling algorithms Highest Density First, Weighted Shortest Elapsed Time First, and Weighted Late Arrival Processor Sharing, are not O(1)-speed O(1)-competitive for the objective of weighted flow even in the special case of fixed variable speed processors (aka the related machines setting). This illustrates that scheduling heterogeneous multiprocessors is a different, and algorithmically more challenging problem, than scheduling homogeneous multiprocessors. We then show that a variation of the non-clairvoyant algorithm Late Arrival Processor Sharing coupled with a non-obvious speed scaling algorithm is scalable for the objective of unweighted flow plus energy on speed-scalable multiprocessors. This is the first provably scalable non-clairvoyant algorithm on heterogeneous multi-processors, even in the related machines setting, for the objective of total (unweighted) flow time.