Publications

Detailed Information

Mapping and Scheduling of Tasks and Communications on Many-Core SoC Under Local Memory Constraint

Cited 14 time in Web of Science Cited 17 time in Scopus
Authors

Lee, Jinho; Chung, Moo-Kyoung; Cho, Yeon-Gon; Ryu, Soojung; Ahn, Jung Ho; Choi, Kiyoung

Issue Date
2013-11
Publisher
Institute of Electrical and Electronics Engineers
Citation
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol.32 No.11, pp.1748-1761
Abstract
There has been extensive research on mapping and scheduling tasks on a many-core SoC. However, none considers the optimization of communication types, which can significantly affect performance, energy consumption, and local memory usage of the SoC. This paper presents an approach to automatic mapping and scheduling of tasks and communications on a many-core SoC. The key idea is to decide the type of each communication between message passing and shared memory when we do the mapping and scheduling. By assigning a proper type to each communication, we can optimize the energy consumption, performance, or energy-delay product. To solve the optimization problem, the approach adopts a probabilistic algorithm coupled with some heuristics. To enhance throughput of the system, it performs software pipelined scheduling of the tasks using a modified iterative modulo scheduling technique. Experiments show that our algorithm achieves on average 50.1% lower energy consumption, 21.0% higher throughput, and 64.9% lower energy- delay product, compared to shared memory only communication.
ISSN
0278-0070
URI
https://hdl.handle.net/10371/200675
DOI
https://doi.org/10.1109/TCAD.2013.2266405
Files in This Item:
There are no files associated with this item.
Appears in Collections:

Related Researcher

  • College of Engineering
  • Department of Electrical and Computer Engineering
Research Area AI Accelerators, Distributed Deep Learning, Neural Architecture Search

Altmetrics

Item View & Download Count

  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Share