This paper studies mapping techniques of multiple applications on embedded many-core SoCs. The mapping techniques proposed in this paper are static which means the mapping is decided at design time. The mapping techniques take into account both inter-application and intra-application parallelism in order to fully utilize the potential parallelism of the many-core architecture. Additionally, the proposed static mapping supports dynamic application switching, which means the applications mapped onto the same cores are switched to each other at runtime. Two approaches are proposed for static mapping: one approach is based on integer linear programming and the other is based on a greedy algorithm. Experimental results show the effectiveness of the proposed techniques.
Ittetsu TANIGUCHI
Ritsumeikan University
Junya KAIDA
Ritsumeikan University
Takuji HIEDA
Kyushu University
Yuko HARA-AZUMI
Tokyo Institute of Technology
Hiroyuki TOMIYAMA
Ritsumeikan University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Ittetsu TANIGUCHI, Junya KAIDA, Takuji HIEDA, Yuko HARA-AZUMI, Hiroyuki TOMIYAMA, "Static Mapping with Dynamic Switching of Multiple Data-Parallel Applications on Embedded Many-Core SoCs" in IEICE TRANSACTIONS on Information,
vol. E97-D, no. 11, pp. 2827-2834, November 2014, doi: 10.1587/transinf.2014EDP7012.
Abstract: This paper studies mapping techniques of multiple applications on embedded many-core SoCs. The mapping techniques proposed in this paper are static which means the mapping is decided at design time. The mapping techniques take into account both inter-application and intra-application parallelism in order to fully utilize the potential parallelism of the many-core architecture. Additionally, the proposed static mapping supports dynamic application switching, which means the applications mapped onto the same cores are switched to each other at runtime. Two approaches are proposed for static mapping: one approach is based on integer linear programming and the other is based on a greedy algorithm. Experimental results show the effectiveness of the proposed techniques.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2014EDP7012/_p
Copy
@ARTICLE{e97-d_11_2827,
author={Ittetsu TANIGUCHI, Junya KAIDA, Takuji HIEDA, Yuko HARA-AZUMI, Hiroyuki TOMIYAMA, },
journal={IEICE TRANSACTIONS on Information},
title={Static Mapping with Dynamic Switching of Multiple Data-Parallel Applications on Embedded Many-Core SoCs},
year={2014},
volume={E97-D},
number={11},
pages={2827-2834},
abstract={This paper studies mapping techniques of multiple applications on embedded many-core SoCs. The mapping techniques proposed in this paper are static which means the mapping is decided at design time. The mapping techniques take into account both inter-application and intra-application parallelism in order to fully utilize the potential parallelism of the many-core architecture. Additionally, the proposed static mapping supports dynamic application switching, which means the applications mapped onto the same cores are switched to each other at runtime. Two approaches are proposed for static mapping: one approach is based on integer linear programming and the other is based on a greedy algorithm. Experimental results show the effectiveness of the proposed techniques.},
keywords={},
doi={10.1587/transinf.2014EDP7012},
ISSN={1745-1361},
month={November},}
Copy
TY - JOUR
TI - Static Mapping with Dynamic Switching of Multiple Data-Parallel Applications on Embedded Many-Core SoCs
T2 - IEICE TRANSACTIONS on Information
SP - 2827
EP - 2834
AU - Ittetsu TANIGUCHI
AU - Junya KAIDA
AU - Takuji HIEDA
AU - Yuko HARA-AZUMI
AU - Hiroyuki TOMIYAMA
PY - 2014
DO - 10.1587/transinf.2014EDP7012
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E97-D
IS - 11
JA - IEICE TRANSACTIONS on Information
Y1 - November 2014
AB - This paper studies mapping techniques of multiple applications on embedded many-core SoCs. The mapping techniques proposed in this paper are static which means the mapping is decided at design time. The mapping techniques take into account both inter-application and intra-application parallelism in order to fully utilize the potential parallelism of the many-core architecture. Additionally, the proposed static mapping supports dynamic application switching, which means the applications mapped onto the same cores are switched to each other at runtime. Two approaches are proposed for static mapping: one approach is based on integer linear programming and the other is based on a greedy algorithm. Experimental results show the effectiveness of the proposed techniques.
ER -