Please use this identifier to cite or link to this item:
|Title:||Communication-aware design space exploration for efficient run-time MPSoC management|
|Source:||Singh, A.K.,Kumar, A.,Wu, J.,Srikanthan, T. (2011). Communication-aware design space exploration for efficient run-time MPSoC management. Proceedings - 2011 4th International Symposium on Parallel Architectures, Algorithms and Programming, PAAP 2011 : 72-76. ScholarBank@NUS Repository. https://doi.org/10.1109/PAAP.2011.18|
|Abstract:||Real-time multi-media applications are increasingly mapped on modern embedded systems based on Multiprocessor Systems-on-Chip (MPSoCs). Tasks of the applications need to be mapped on the MPSoC resources efficiently in order to satisfy their performance constraints. Exploring all the mappings, i.e. tasks to resources combinations exhaustively may take days or weeks. Additionally, the exploration is performed at design-time that cannot handle dynamism in applications and resources' status. A run-time mapping technique can cater for the dynamism but cannot guarantee for strict timing deadlines due to large computations involved at run-time. Thus, an approach performing feasible compute intensive exploration at design-time and using the explored results at run-time is required. This paper presents a solution in the same direction. Communication-aware design space exploration techniques have been proposed to explore different mapping options to be selected at run-time subject to desired performance and available MPSoC resources. Experiments show that the proposed techniques for exploration are faster over an exhaustive exploration and provides almost the same quality of results. © 2011 IEEE.|
|Source Title:||Proceedings - 2011 4th International Symposium on Parallel Architectures, Algorithms and Programming, PAAP 2011|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 13, 2017
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.