Net-length-based routability-driven power-aware clustering

Lakshmi Easwaran, Ali Akoglu

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

The state-of-the-art power-aware clustering tool, P-T-VPack, achieves energy reduction by localizing nets with high switching activity at the expense of channel width and area. In this study, we employ predicted individual postplacement net length information during clustering and prioritize longer nets. This approach targets the capacitance factor for energy reduction, and prioritizes longer nets for channel width and area reduction. We first introduce a new clustering strategy, W-T-VPack, which replaces the switching activity in P-T-VPack with a net length factor. We obtain a 9.87% energy reduction over T-VPack (3.78% increase over P-T-VPack), while at the same time completely eliminating P-T-VPack's channel width and area overhead. We then introduce W-P-T-VPack, which combines switching activity and net length factors. W-P-T-VPack achieves 14.26% energy reduction (0.31% increase over P-T-VPack), while further improving channel width by up to 12.87% for different cluster sizes. We investigate the energy performance of routability (channel width)-driven clustering algorithms, and show that W-T-VPack consistently outperforms T-RPack and iRAC by at least 11.23% and 9.07%, respectively. We conclude that net-length-based clustering is an effective method to concurrently target energy and channel width.

Original languageEnglish (US)
Article number38
JournalACM Transactions on Reconfigurable Technology and Systems
Volume4
Issue number4
DOIs
StatePublished - Dec 2011

Fingerprint

Clustering algorithms
Capacitance

Keywords

  • Channel width
  • Clustering
  • Field programmable gate array
  • Net length prediction
  • Power

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Net-length-based routability-driven power-aware clustering. / Easwaran, Lakshmi; Akoglu, Ali.

In: ACM Transactions on Reconfigurable Technology and Systems, Vol. 4, No. 4, 38, 12.2011.

Research output: Contribution to journalArticle

@article{ce1ed5209aba46868bc98b9a40a2bbd8,
title = "Net-length-based routability-driven power-aware clustering",
abstract = "The state-of-the-art power-aware clustering tool, P-T-VPack, achieves energy reduction by localizing nets with high switching activity at the expense of channel width and area. In this study, we employ predicted individual postplacement net length information during clustering and prioritize longer nets. This approach targets the capacitance factor for energy reduction, and prioritizes longer nets for channel width and area reduction. We first introduce a new clustering strategy, W-T-VPack, which replaces the switching activity in P-T-VPack with a net length factor. We obtain a 9.87{\%} energy reduction over T-VPack (3.78{\%} increase over P-T-VPack), while at the same time completely eliminating P-T-VPack's channel width and area overhead. We then introduce W-P-T-VPack, which combines switching activity and net length factors. W-P-T-VPack achieves 14.26{\%} energy reduction (0.31{\%} increase over P-T-VPack), while further improving channel width by up to 12.87{\%} for different cluster sizes. We investigate the energy performance of routability (channel width)-driven clustering algorithms, and show that W-T-VPack consistently outperforms T-RPack and iRAC by at least 11.23{\%} and 9.07{\%}, respectively. We conclude that net-length-based clustering is an effective method to concurrently target energy and channel width.",
keywords = "Channel width, Clustering, Field programmable gate array, Net length prediction, Power",
author = "Lakshmi Easwaran and Ali Akoglu",
year = "2011",
month = "12",
doi = "10.1145/2068716.2068724",
language = "English (US)",
volume = "4",
journal = "ACM Transactions on Reconfigurable Technology and Systems",
issn = "1936-7406",
publisher = "Association for Computing Machinery (ACM)",
number = "4",

}

TY - JOUR

T1 - Net-length-based routability-driven power-aware clustering

AU - Easwaran, Lakshmi

AU - Akoglu, Ali

PY - 2011/12

Y1 - 2011/12

N2 - The state-of-the-art power-aware clustering tool, P-T-VPack, achieves energy reduction by localizing nets with high switching activity at the expense of channel width and area. In this study, we employ predicted individual postplacement net length information during clustering and prioritize longer nets. This approach targets the capacitance factor for energy reduction, and prioritizes longer nets for channel width and area reduction. We first introduce a new clustering strategy, W-T-VPack, which replaces the switching activity in P-T-VPack with a net length factor. We obtain a 9.87% energy reduction over T-VPack (3.78% increase over P-T-VPack), while at the same time completely eliminating P-T-VPack's channel width and area overhead. We then introduce W-P-T-VPack, which combines switching activity and net length factors. W-P-T-VPack achieves 14.26% energy reduction (0.31% increase over P-T-VPack), while further improving channel width by up to 12.87% for different cluster sizes. We investigate the energy performance of routability (channel width)-driven clustering algorithms, and show that W-T-VPack consistently outperforms T-RPack and iRAC by at least 11.23% and 9.07%, respectively. We conclude that net-length-based clustering is an effective method to concurrently target energy and channel width.

AB - The state-of-the-art power-aware clustering tool, P-T-VPack, achieves energy reduction by localizing nets with high switching activity at the expense of channel width and area. In this study, we employ predicted individual postplacement net length information during clustering and prioritize longer nets. This approach targets the capacitance factor for energy reduction, and prioritizes longer nets for channel width and area reduction. We first introduce a new clustering strategy, W-T-VPack, which replaces the switching activity in P-T-VPack with a net length factor. We obtain a 9.87% energy reduction over T-VPack (3.78% increase over P-T-VPack), while at the same time completely eliminating P-T-VPack's channel width and area overhead. We then introduce W-P-T-VPack, which combines switching activity and net length factors. W-P-T-VPack achieves 14.26% energy reduction (0.31% increase over P-T-VPack), while further improving channel width by up to 12.87% for different cluster sizes. We investigate the energy performance of routability (channel width)-driven clustering algorithms, and show that W-T-VPack consistently outperforms T-RPack and iRAC by at least 11.23% and 9.07%, respectively. We conclude that net-length-based clustering is an effective method to concurrently target energy and channel width.

KW - Channel width

KW - Clustering

KW - Field programmable gate array

KW - Net length prediction

KW - Power

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

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

U2 - 10.1145/2068716.2068724

DO - 10.1145/2068716.2068724

M3 - Article

AN - SCOPUS:84867548148

VL - 4

JO - ACM Transactions on Reconfigurable Technology and Systems

JF - ACM Transactions on Reconfigurable Technology and Systems

SN - 1936-7406

IS - 4

M1 - 38

ER -