TY - GEN
T1 - Mapping Method of MATLAB/Simulink Model for Embedded Many-Core Platform
AU - Honda, Kentaro
AU - Kojima, Sasuga
AU - Fujimoto, Hiroshi
AU - Edahiro, Masato
AU - Azumi, Takuya
PY - 2020/3
Y1 - 2020/3
N2 - Multi-/many-core processors are being increasingly used to reduce power consumption and improve performance. In addition, the use of Model-Based Development for embedded systems has been increasing. Relative to these trends, Model-Based Parallelizer (MBP) has an essential role in parallelizing applications (i.e., Simulink blocks) at the model level. MBP maps Simulink blocks to cores using various types of information such as block characteristics, a C code, and the multi-/many-core hardware implementation. However, MBP does not consider many-core hardware with cluster structures. This paper proposes an algorithm that decides on core allocations by considering cluster structures. The proposed algorithm combines two other algorithms: one algorithm uses the core allocation of MBP and path analysis at the cluster-level and considers the influence of communication contention to decide on cluster allocations, and the other algorithm uses the results of MBP and remaps cluster allocations. The proposed algorithm produces better results than its component algorithms could separately. Evaluations demonstrate that the proposed algorithm obtained the better results than the existing method in terms of execution time on random and real models.
AB - Multi-/many-core processors are being increasingly used to reduce power consumption and improve performance. In addition, the use of Model-Based Development for embedded systems has been increasing. Relative to these trends, Model-Based Parallelizer (MBP) has an essential role in parallelizing applications (i.e., Simulink blocks) at the model level. MBP maps Simulink blocks to cores using various types of information such as block characteristics, a C code, and the multi-/many-core hardware implementation. However, MBP does not consider many-core hardware with cluster structures. This paper proposes an algorithm that decides on core allocations by considering cluster structures. The proposed algorithm combines two other algorithms: one algorithm uses the core allocation of MBP and path analysis at the cluster-level and considers the influence of communication contention to decide on cluster allocations, and the other algorithm uses the results of MBP and remaps cluster allocations. The proposed algorithm produces better results than its component algorithms could separately. Evaluations demonstrate that the proposed algorithm obtained the better results than the existing method in terms of execution time on random and real models.
KW - Embedded Systems
KW - Model-Based Development
KW - Multi-/Many-core
UR - http://www.scopus.com/inward/record.url?scp=85085489282&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85085489282&partnerID=8YFLogxK
U2 - 10.1109/PDP50117.2020.00034
DO - 10.1109/PDP50117.2020.00034
M3 - Conference contribution
AN - SCOPUS:85085489282
T3 - Proceedings - 2020 28th Euromicro International Conference on Parallel, Distributed and Network-Based Processing, PDP 2020
SP - 182
EP - 186
BT - Proceedings - 2020 28th Euromicro International Conference on Parallel, Distributed and Network-Based Processing, PDP 2020
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 28th Euromicro International Conference on Parallel, Distributed and Network-Based Processing, PDP 2020
Y2 - 11 March 2020 through 13 March 2020
ER -