Mapping and scheduling of tasks and communications on many-core SoC under local memory constraint

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

Research output: Contribution to journalArticle

16 Citations (Scopus)

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.

Original languageEnglish
Article number6634549
Pages (from-to)1748-1761
Number of pages14
JournalIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Volume32
Issue number11
DOIs
Publication statusPublished - 2013 Nov 4

Fingerprint

Scheduling
Data storage equipment
Communication
Energy utilization
Throughput
Message passing
System-on-chip
Experiments

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering

Cite this

Lee, Jinho ; Chung, Moo Kyoung ; Cho, Yeon Gon ; Ryu, Soojung ; Ahn, Jung Ho ; Choi, Kiyoung. / Mapping and scheduling of tasks and communications on many-core SoC under local memory constraint. In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 2013 ; Vol. 32, No. 11. pp. 1748-1761.
@article{50afef14ec6e458fb5ba66a8d2afd593,
title = "Mapping and scheduling of tasks and communications on many-core SoC under local memory constraint",
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.",
author = "Jinho Lee and Chung, {Moo Kyoung} and Cho, {Yeon Gon} and Soojung Ryu and Ahn, {Jung Ho} and Kiyoung Choi",
year = "2013",
month = "11",
day = "4",
doi = "10.1109/TCAD.2013.2266405",
language = "English",
volume = "32",
pages = "1748--1761",
journal = "IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems",
issn = "0278-0070",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "11",

}

Mapping and scheduling of tasks and communications on many-core SoC under local memory constraint. / Lee, Jinho; Chung, Moo Kyoung; Cho, Yeon Gon; Ryu, Soojung; Ahn, Jung Ho; Choi, Kiyoung.

In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 32, No. 11, 6634549, 04.11.2013, p. 1748-1761.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Mapping and scheduling of tasks and communications on many-core SoC under local memory constraint

AU - Lee, Jinho

AU - Chung, Moo Kyoung

AU - Cho, Yeon Gon

AU - Ryu, Soojung

AU - Ahn, Jung Ho

AU - Choi, Kiyoung

PY - 2013/11/4

Y1 - 2013/11/4

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84886664149&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84886664149&partnerID=8YFLogxK

U2 - 10.1109/TCAD.2013.2266405

DO - 10.1109/TCAD.2013.2266405

M3 - Article

AN - SCOPUS:84886664149

VL - 32

SP - 1748

EP - 1761

JO - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

JF - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

SN - 0278-0070

IS - 11

M1 - 6634549

ER -