Interconnection allocation between functional units and registers in High-Level Synthesis

Cong Hao, Nan Wang, Song Chen, Takeshi Yoshimura, Min You Wu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Data path connection elements usually consume a significant amount of both power and area on a VLSI chip. In this paper, we focus on the interconnection allocation problem conducted after operation scheduling and binding in High-Level Synthesis, aimed at minimum interconnection complexity, power consumption and area cost. During interconnection allocation, the port assignment step, that connects the registers to the operator ports through multiplexers (MUXes), is extraordinarily crucial to the final result in terms of the interconnection complexity. We formulate the port assignment problem for binary commutative operators as a bipartite graph partition problem followed by a vertex cover, and adopt the Fiduccia and Mattheyses (FM) Algorithm to iteratively improve the partition by moving or swapping the graph vertices. The experimental results show that our proposed algorithm is able to achieve 35.9% optimality increasing and 33.1% execution time reduction compared with the previous works.

Original languageEnglish
Title of host publicationProceedings of International Conference on ASIC
PublisherIEEE Computer Society
ISBN (Print)9781467364157
DOIs
Publication statusPublished - 2013
Event2013 IEEE 10th International Conference on ASIC, ASICON 2013 - Shenzhen
Duration: 2013 Oct 282013 Oct 31

Other

Other2013 IEEE 10th International Conference on ASIC, ASICON 2013
CityShenzhen
Period13/10/2813/10/31

Fingerprint

Electric power utilization
Scheduling
Costs
High level synthesis

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Hao, C., Wang, N., Chen, S., Yoshimura, T., & Wu, M. Y. (2013). Interconnection allocation between functional units and registers in High-Level Synthesis. In Proceedings of International Conference on ASIC [6811938] IEEE Computer Society. https://doi.org/10.1109/ASICON.2013.6811938

Interconnection allocation between functional units and registers in High-Level Synthesis. / Hao, Cong; Wang, Nan; Chen, Song; Yoshimura, Takeshi; Wu, Min You.

Proceedings of International Conference on ASIC. IEEE Computer Society, 2013. 6811938.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hao, C, Wang, N, Chen, S, Yoshimura, T & Wu, MY 2013, Interconnection allocation between functional units and registers in High-Level Synthesis. in Proceedings of International Conference on ASIC., 6811938, IEEE Computer Society, 2013 IEEE 10th International Conference on ASIC, ASICON 2013, Shenzhen, 13/10/28. https://doi.org/10.1109/ASICON.2013.6811938
Hao C, Wang N, Chen S, Yoshimura T, Wu MY. Interconnection allocation between functional units and registers in High-Level Synthesis. In Proceedings of International Conference on ASIC. IEEE Computer Society. 2013. 6811938 https://doi.org/10.1109/ASICON.2013.6811938
Hao, Cong ; Wang, Nan ; Chen, Song ; Yoshimura, Takeshi ; Wu, Min You. / Interconnection allocation between functional units and registers in High-Level Synthesis. Proceedings of International Conference on ASIC. IEEE Computer Society, 2013.
@inproceedings{e8e5369111984115b62d3d39d3743ca8,
title = "Interconnection allocation between functional units and registers in High-Level Synthesis",
abstract = "Data path connection elements usually consume a significant amount of both power and area on a VLSI chip. In this paper, we focus on the interconnection allocation problem conducted after operation scheduling and binding in High-Level Synthesis, aimed at minimum interconnection complexity, power consumption and area cost. During interconnection allocation, the port assignment step, that connects the registers to the operator ports through multiplexers (MUXes), is extraordinarily crucial to the final result in terms of the interconnection complexity. We formulate the port assignment problem for binary commutative operators as a bipartite graph partition problem followed by a vertex cover, and adopt the Fiduccia and Mattheyses (FM) Algorithm to iteratively improve the partition by moving or swapping the graph vertices. The experimental results show that our proposed algorithm is able to achieve 35.9{\%} optimality increasing and 33.1{\%} execution time reduction compared with the previous works.",
author = "Cong Hao and Nan Wang and Song Chen and Takeshi Yoshimura and Wu, {Min You}",
year = "2013",
doi = "10.1109/ASICON.2013.6811938",
language = "English",
isbn = "9781467364157",
booktitle = "Proceedings of International Conference on ASIC",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Interconnection allocation between functional units and registers in High-Level Synthesis

AU - Hao, Cong

AU - Wang, Nan

AU - Chen, Song

AU - Yoshimura, Takeshi

AU - Wu, Min You

PY - 2013

Y1 - 2013

N2 - Data path connection elements usually consume a significant amount of both power and area on a VLSI chip. In this paper, we focus on the interconnection allocation problem conducted after operation scheduling and binding in High-Level Synthesis, aimed at minimum interconnection complexity, power consumption and area cost. During interconnection allocation, the port assignment step, that connects the registers to the operator ports through multiplexers (MUXes), is extraordinarily crucial to the final result in terms of the interconnection complexity. We formulate the port assignment problem for binary commutative operators as a bipartite graph partition problem followed by a vertex cover, and adopt the Fiduccia and Mattheyses (FM) Algorithm to iteratively improve the partition by moving or swapping the graph vertices. The experimental results show that our proposed algorithm is able to achieve 35.9% optimality increasing and 33.1% execution time reduction compared with the previous works.

AB - Data path connection elements usually consume a significant amount of both power and area on a VLSI chip. In this paper, we focus on the interconnection allocation problem conducted after operation scheduling and binding in High-Level Synthesis, aimed at minimum interconnection complexity, power consumption and area cost. During interconnection allocation, the port assignment step, that connects the registers to the operator ports through multiplexers (MUXes), is extraordinarily crucial to the final result in terms of the interconnection complexity. We formulate the port assignment problem for binary commutative operators as a bipartite graph partition problem followed by a vertex cover, and adopt the Fiduccia and Mattheyses (FM) Algorithm to iteratively improve the partition by moving or swapping the graph vertices. The experimental results show that our proposed algorithm is able to achieve 35.9% optimality increasing and 33.1% execution time reduction compared with the previous works.

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

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

U2 - 10.1109/ASICON.2013.6811938

DO - 10.1109/ASICON.2013.6811938

M3 - Conference contribution

AN - SCOPUS:84901331542

SN - 9781467364157

BT - Proceedings of International Conference on ASIC

PB - IEEE Computer Society

ER -