Zeitschriftenartikel:
A. Pathania, V. Venkataramani, M. Shafique, T. Mitra, J. Henkel:
"Optimal Greedy Algorithm for Many-Core Scheduling";
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems,
36
(2017),
6;
S. 1054
- 1058.
Kurzfassung englisch:
In this paper, we propose an optimal greedy algorithm for the problem of run-time many-core scheduling. The previously best known centralized optimal algorithm proposed for the problem is based on dynamic programming. A dynamic programming-based scheduler has high overheads which grow fast with increase in both the number of cores in the many-cores as well as number of tasks independently executing on them. We show in this paper that the inherent concavity of extractable instructions per cycle in tasks with increase in number of allocated cores allows for an alternative greedy algorithm. The proposed algorithm significantly reduces the run-time scheduling overheads, while maintaining theoretical optimality. In practice, it reduces the problem solving time 10000× to provide near-optimal solutions.
Schlagworte:
Greedy algorithm, many-cores, scheduling, throughput maximization
"Offizielle" elektronische Version der Publikation (entsprechend ihrem Digital Object Identifier - DOI)
http://dx.doi.org/10.1109/TCAD.2016.2618880
Erstellt aus der Publikationsdatenbank der Technischen Universität Wien.