Exploration of power domain partitioning with concurrent task mapping and scheduling for application-specific multi-core socs

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper proposes a novel approach to explore the design space of Power Domain (PD) partitioning in the architecture definition phase of heterogeneous SoCs. By formulating an Integer Linear Program (ILP), task mapping and scheduling is determined concurrently while considering power-off dependencies among cores in the same PD and the power-gating break-even time. Compared to state-of-the-art approaches aiming at design phases where task mapping and scheduling has been frozen, our proposed approach shifts joint exploration into earlier design phases, creates more power-gating opportunities for PD partitions, and thus identifies better trade-offs in terms of energy consumption and design costs.

Cite

CITATION STYLE

APA

Wang, B., Imtiaz, A., Falk, J., Glaß, M., & Teich, J. (2020). Exploration of power domain partitioning with concurrent task mapping and scheduling for application-specific multi-core socs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12155 LNCS, pp. 153–167). Springer. https://doi.org/10.1007/978-3-030-52794-5_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free