Conference Paper

A hybrid memory organization to enhance task migration and dynamic task allocation in NoC-based MPSoCs.

DOI: 10.1145/1284480.1284557 Conference: Proceedings of the 20th Annual Symposium on Integrated Circuits and Systems Design, SBCCI 2007, Copacabana, Rio de Janeiro, Brazil, September 3-6, 2007
Source: DBLP

ABSTRACT Regarding MPSoCs, dynamic task allocation and task migration are still open research areas and, for both of them, there is no clear memory organization winner. While bus-connected systems commonly use a shared memory paradigm, NoC-based ones easily allow the exploration of distributed memory alternatives. This paper proposes a hybrid memory organization for NoC-based systems as the way to minimize the energy spent during the code transfer when task migration or dynamic task allocation needs to be performed. In our hybrid approach, the code can be transferred from the node where the task was originally running or from a memory positioned at the center of the system. The choice between the two options is done at runtime in a very intuitive way, based on the distance between the nodes involved on the transfer. Results are very encouraging and indicate that the proposed hybrid organization reduces the code transfer energy by 24% and 10% on average, as compared to global- and distributed-only memory organizations, respectively.

0 Bookmarks
 · 
87 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: With the development of the semiconductor industry, more processors can be integrated onto a single chip. Network-on-Chip (NoC) is an efficient solution for the interconnections on chip for many-core system with many processor cores on chip. However, enhancing performance with lower power consumption is still a challenge. The core issue is the mapping of applications to NoC. A common method is to find processes with high communication with each other and map them to neighborhoods. Thus, they can reduce the communication distance and avoid unnecessary energy cost. This work proposed an online scheduling method, which aims at the optimization of task scheduling algorithm with low communication energy consumption. The communication status of applications at run time is analyzed first. Then, the algorithm will compute the mapping method dynamically and implement the real-time scheduling online. Experimental results based on simulation show that the algorithm proposed in this review can achieve more than 30% communication energy saving with low complexity.
    10th IEEE International Conference on Computer and Information Technology, CIT 2010, Bradford, West Yorkshire, UK, June 29-July 1, 2010; 01/2010
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Embedded computing systems are currently present in a wide range of consumer goods and their main characteristic is the implicit specialized be-havior but keeping a certain level of flexibility once it avoids redesigning due to small requirement changes. Thus, microprocessors usually are a good al-ternative to achieve such flexibility. Consequently, embedded systems designs make use of homogeneous or heterogeneous processors families for its complete implementation, which is known as Multiprocessor System-on-Chip (MPSoC), which can have a performance speed up through using dynamic load balancing strategies, such as task migration, to fairly distribute the existing tasks among all embedded processors. The objectives of this work are to discuss architec-tural aspects for embedded systems, which allow a dynamic task migration and its implications, as well as to present different techniques for the dynamic task migration showing their possible use in MPSoCs.
    01/2008;
  • [Show abstract] [Hide abstract]
    ABSTRACT: With the development of the semiconductor technology, more processors can be integrated onto a single chip. Network-on-Chip is an efficient communication solution for many-core system. However, enhancing performance with lower energy consumption is still a challenge. One critical issue is mapping applications to NoC. This work proposed an online mapping method, which optimizes task mapping algorithm to reduce communication energy consumption. The communication status of applications at runtime is analyzed first. Then, the algorithm computes the mapping placement dynamically and implements the real-time mapping online. Experimental results based on simulation show that the algorithm proposed in this article can achieve more than 20% communication energy saving compared with first fit mapping and nearest neighbor mapping. The migration cost caused by the remapping process is also considered, and can be calculated at the runtime to estimate the effect of remapping.
    The Journal of Supercomputing 06/2013; 64(3). · 0.92 Impact Factor

Full-text (2 Sources)

View
6 Downloads
Available from
Jun 2, 2014