2012
DOI: 10.1007/978-3-642-28293-5_5
|View full text |Cite
|
Sign up to set email alerts
|

Static Task Mapping for Tiled Chip Multiprocessors with Multiple Voltage Islands

Abstract: Abstract-The complexity of large Chip Multiprocessors (CMP) makes design reuse a practical approach to reduce the manufacturing and design cost of high-performance systems. This paper proposes techniques for static task mapping onto general-purpose CMPs with multiple pre-defined voltage islands for power management. The CMPs are assumed to contain different classes of processing elements with multiple voltage/frequency execution modes to better cover a large range of applications. Task mapping is performed wit… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
7
0

Year Published

2015
2015
2018
2018

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 14 publications
(7 citation statements)
references
References 20 publications
(31 reference statements)
0
7
0
Order By: Relevance
“…The difference between EOH (in this paper) and the algorithm presented in [13], is that we map one task set to one core, instead of just one task per core; and that we do not consider the energy consumed for communication between tasks, thus our fitness functions are simplified. Although EOH may help to improve the solutions, in the worst cases, the quality of the solution remains as the initial solution.…”
Section: Description Of Simple Heuristic Algorithmsmentioning
confidence: 98%
See 4 more Smart Citations
“…The difference between EOH (in this paper) and the algorithm presented in [13], is that we map one task set to one core, instead of just one task per core; and that we do not consider the energy consumed for communication between tasks, thus our fitness functions are simplified. Although EOH may help to improve the solutions, in the worst cases, the quality of the solution remains as the initial solution.…”
Section: Description Of Simple Heuristic Algorithmsmentioning
confidence: 98%
“…It also describes an algorithm extended from [13], based on extremal optimization. These three algorithms have low time complexity but derive non-optimal solutions.…”
Section: Simple Heuristic Algorithmsmentioning
confidence: 99%
See 3 more Smart Citations