Task Assignment for Multiple-Application Workload with Streaming Ones in MPSoC Using Shared Memory

Article Preview

Abstract:

Large scale Multi-Processor System-on-a-chip (MPSoC) based on Network on Chip (NoC) can support multiple applications running simultaneously. When the multiple-application workload includes streaming applications processing massive data, the communication concentrated on shared memory can't be ignored. In this paper, we propose a task assignment strategy for multiple-application workload which includes one streaming application on a NoC-based MPSoC. The proposed algorithm first assigns the streaming application centering the multi-port shared memory, and then assigns the other applications minimizing external communication congestion. By adopting the proposed algorithm, the memory-contention tasks are assigned to the PEs close to the shared memory and the overall congestion is minimized. This allows the system to provide better overall performance.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1781-1785

Citation:

Online since:

December 2012

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] J. Nurmi, "Network-on-chip: A new paradigm for system-on-chip design," vol. 2005, Tampere, Finland, 2005, p.2 – 6, layered protocols;Network-on-Chip;Proposed networks;.

DOI: 10.1109/issoc.2005.1595630

Google Scholar

[2] C.-L. Chou and R. Marculescu, "User-aware dynamic task allocation in networks-on-chip," Munich, Germany, 2008, p.1232 – 1237

DOI: 10.1109/date.2008.4484847

Google Scholar

[3] S.-H. Lee, Y.-C. Yoon, and S.-Y. Hwang, "Communication-aware task assignment algorithm for mpsoc using shared memory," Journal of Systems Architecture, vol.56, no. 7, p.233 – 241, 2010.

DOI: 10.1016/j.sysarc.2010.03.001

Google Scholar

[4] T. T. Ye, L. Benini, and G. De Micheli, "Analysis of power consumption on switch fabrics in network routers," New Orleans, LA, United states, 2002, p.524 – 529.

DOI: 10.1109/dac.2002.1012681

Google Scholar

[5] K. Vallerio, "Task graphs for free (tgff v3.5), http://ziyang.eecs.umich.edu/~dickrp/tgff/."

Google Scholar