The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
A programação do sistema multiprocessador no chip (MPSoC) requer o particionamento dos programas de referência sequenciais em vários processadores executados em paralelo. No entanto, os designers ainda precisam particionar o código manualmente devido à falta de técnicas de partição automatizadas. Para resolver esta questão, este artigo propõe um algoritmo de exploração de partição baseado nas técnicas de suavização de espaço de busca e implementa o método proposto usando um processador extensível comercial (processador Xtensa LX2 da Tensilica Inc.). Verificamos a viabilidade do algoritmo implementando o benchmark MPEG2 no sistema de dois processadores baseado em Xtensa. Os resultados experimentais finais indicam uma melhoria de desempenho de pelo menos 1.6
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.
Copiar
Kang ZHAO, Jinian BIAN, Sheqin DONG, Yang SONG, Satoshi GOTO, "Exploring Partitions Based on Search Space Smoothing for Heterogeneous Multiprocessor System" in IEICE TRANSACTIONS on Fundamentals,
vol. E91-A, no. 9, pp. 2456-2464, September 2008, doi: 10.1093/ietfec/e91-a.9.2456.
Abstract: Programming the multiprocessor system-on-chip (MPSoC) requires partitioning the sequential reference programs onto multiple processors running in parallel. However, designers still need to partition the code manually due to the lack of automated partition techniques. To settle this issue, this paper proposes a partition exploration algorithm based on the search space smoothing techniques, and implements the proposed method using a commercial extensible processor (Xtensa LX2 processor from Tensilica Inc.). We have verified the feasibility of the algorithm by implementing the MPEG2 benchmark on the Xtensa-based two-processor system. The final experimental results indicate a performance improvement of at least 1.6
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e91-a.9.2456/_p
Copiar
@ARTICLE{e91-a_9_2456,
author={Kang ZHAO, Jinian BIAN, Sheqin DONG, Yang SONG, Satoshi GOTO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Exploring Partitions Based on Search Space Smoothing for Heterogeneous Multiprocessor System},
year={2008},
volume={E91-A},
number={9},
pages={2456-2464},
abstract={Programming the multiprocessor system-on-chip (MPSoC) requires partitioning the sequential reference programs onto multiple processors running in parallel. However, designers still need to partition the code manually due to the lack of automated partition techniques. To settle this issue, this paper proposes a partition exploration algorithm based on the search space smoothing techniques, and implements the proposed method using a commercial extensible processor (Xtensa LX2 processor from Tensilica Inc.). We have verified the feasibility of the algorithm by implementing the MPEG2 benchmark on the Xtensa-based two-processor system. The final experimental results indicate a performance improvement of at least 1.6
keywords={},
doi={10.1093/ietfec/e91-a.9.2456},
ISSN={1745-1337},
month={September},}
Copiar
TY - JOUR
TI - Exploring Partitions Based on Search Space Smoothing for Heterogeneous Multiprocessor System
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2456
EP - 2464
AU - Kang ZHAO
AU - Jinian BIAN
AU - Sheqin DONG
AU - Yang SONG
AU - Satoshi GOTO
PY - 2008
DO - 10.1093/ietfec/e91-a.9.2456
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E91-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2008
AB - Programming the multiprocessor system-on-chip (MPSoC) requires partitioning the sequential reference programs onto multiple processors running in parallel. However, designers still need to partition the code manually due to the lack of automated partition techniques. To settle this issue, this paper proposes a partition exploration algorithm based on the search space smoothing techniques, and implements the proposed method using a commercial extensible processor (Xtensa LX2 processor from Tensilica Inc.). We have verified the feasibility of the algorithm by implementing the MPEG2 benchmark on the Xtensa-based two-processor system. The final experimental results indicate a performance improvement of at least 1.6
ER -