IEICE TRANSACTIONS on Information
Static Mapping of Multiple Data-Parallel Applications on Embedded Many-Core SoCs
Summary :
This paper studies the static mapping of multiple applications on embedded many-core SoCs. The mapping techniques proposed in this paper take into account both inter-application and intra-application parallelism in order to fully utilize the potential parallelism of the many-core architecture. Two approaches are proposed for static mapping: one approach is based on integer linear programming and the other is based on a greedy algorithm. Experiments show the effectiveness of the proposed techniques.
- Publication
- IEICE TRANSACTIONS on Information Vol.E96-D No.10 pp.2268-2271
- Publication Date
- 2013/10/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.E96.D.2268
- Type of Manuscript
- LETTER
- Category
- Computer System
Authors
Junya KAIDA
Ritsumeikan University
Yuko HARA-AZUMI
Nara Institute of Science and Technology
Takuji HIEDA
Ritsumeikan University
Ittetsu TANIGUCHI
Ritsumeikan University
Hiroyuki TOMIYAMA
Ritsumeikan University
Koji INOUE
Kyushu University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Junya KAIDA, Yuko HARA-AZUMI, Takuji HIEDA, Ittetsu TANIGUCHI, Hiroyuki TOMIYAMA, Koji INOUE, "Static Mapping of Multiple Data-Parallel Applications on Embedded Many-Core SoCs" in IEICE TRANSACTIONS on Information,
vol. E96-D, no. 10, pp. 2268-2271, October 2013, doi: 10.1587/transinf.E96.D.2268.
Abstract: This paper studies the static mapping of multiple applications on embedded many-core SoCs. The mapping techniques proposed in this paper take into account both inter-application and intra-application parallelism in order to fully utilize the potential parallelism of the many-core architecture. Two approaches are proposed for static mapping: one approach is based on integer linear programming and the other is based on a greedy algorithm. Experiments show the effectiveness of the proposed techniques.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E96.D.2268/_p
Copy
@ARTICLE{e96-d_10_2268,
author={Junya KAIDA, Yuko HARA-AZUMI, Takuji HIEDA, Ittetsu TANIGUCHI, Hiroyuki TOMIYAMA, Koji INOUE, },
journal={IEICE TRANSACTIONS on Information},
title={Static Mapping of Multiple Data-Parallel Applications on Embedded Many-Core SoCs},
year={2013},
volume={E96-D},
number={10},
pages={2268-2271},
abstract={This paper studies the static mapping of multiple applications on embedded many-core SoCs. The mapping techniques proposed in this paper take into account both inter-application and intra-application parallelism in order to fully utilize the potential parallelism of the many-core architecture. Two approaches are proposed for static mapping: one approach is based on integer linear programming and the other is based on a greedy algorithm. Experiments show the effectiveness of the proposed techniques.},
keywords={},
doi={10.1587/transinf.E96.D.2268},
ISSN={1745-1361},
month={October},}
Copy
TY - JOUR
TI - Static Mapping of Multiple Data-Parallel Applications on Embedded Many-Core SoCs
T2 - IEICE TRANSACTIONS on Information
SP - 2268
EP - 2271
AU - Junya KAIDA
AU - Yuko HARA-AZUMI
AU - Takuji HIEDA
AU - Ittetsu TANIGUCHI
AU - Hiroyuki TOMIYAMA
AU - Koji INOUE
PY - 2013
DO - 10.1587/transinf.E96.D.2268
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E96-D
IS - 10
JA - IEICE TRANSACTIONS on Information
Y1 - October 2013
AB - This paper studies the static mapping of multiple applications on embedded many-core SoCs. The mapping techniques proposed in this paper take into account both inter-application and intra-application parallelism in order to fully utilize the potential parallelism of the many-core architecture. Two approaches are proposed for static mapping: one approach is based on integer linear programming and the other is based on a greedy algorithm. Experiments show the effectiveness of the proposed techniques.
ER -
English
