Optimal clustering for delay minimization

Rajmohan Rajaraman; D. F. Wong

doi:10.1145/157485.164907

Optimal clustering for delay minimization

Rajmohan Rajaraman, D. F. Wong

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

This paper addresses the problem of circuit clustering for delay minimization, subject to capacity constraints. We use the general delay model, for which only heuristic solutions were unknown. We present an optimal polynomial time algorithm for combinational circuits under this model. Our algorithm can be generalized to solve the problem under any monotone clustering constraint.

Original language	English (US)
Title of host publication	Proceedings - Design Automation Conference
Publisher	Publ by IEEE
Pages	309-314
Number of pages	6
ISBN (Print)	0897915771, 9780897915779
DOIs	https://doi.org/10.1145/157485.164907
State	Published - Jan 1 1993
Externally published	Yes
Event	Proceedings of the 30th ACM/IEEE Design Automation Conference - Dallas, TX, USA Duration: Jun 14 1993 → Jun 18 1993

Publication series

Name	Proceedings - Design Automation Conference
ISSN (Print)	0146-7123

Other

Other	Proceedings of the 30th ACM/IEEE Design Automation Conference
City	Dallas, TX, USA
Period	6/14/93 → 6/18/93

ASJC Scopus subject areas

Engineering(all)

Access to Document

10.1145/157485.164907

Fingerprint Dive into the research topics of 'Optimal clustering for delay minimization'. Together they form a unique fingerprint.

Cite this

@inproceedings{643be0fc93cf42338aa96369cca42ea7,

title = "Optimal clustering for delay minimization",

abstract = "This paper addresses the problem of circuit clustering for delay minimization, subject to capacity constraints. We use the general delay model, for which only heuristic solutions were unknown. We present an optimal polynomial time algorithm for combinational circuits under this model. Our algorithm can be generalized to solve the problem under any monotone clustering constraint.",

author = "Rajmohan Rajaraman and Wong, {D. F.}",

year = "1993",

month = jan,

day = "1",

doi = "10.1145/157485.164907",

language = "English (US)",

isbn = "0897915771",

series = "Proceedings - Design Automation Conference",

publisher = "Publ by IEEE",

pages = "309--314",

booktitle = "Proceedings - Design Automation Conference",

note = "Proceedings of the 30th ACM/IEEE Design Automation Conference ; Conference date: 14-06-1993 Through 18-06-1993",

}

TY - GEN

T1 - Optimal clustering for delay minimization

AU - Rajaraman, Rajmohan

AU - Wong, D. F.

PY - 1993/1/1

Y1 - 1993/1/1

N2 - This paper addresses the problem of circuit clustering for delay minimization, subject to capacity constraints. We use the general delay model, for which only heuristic solutions were unknown. We present an optimal polynomial time algorithm for combinational circuits under this model. Our algorithm can be generalized to solve the problem under any monotone clustering constraint.

AB - This paper addresses the problem of circuit clustering for delay minimization, subject to capacity constraints. We use the general delay model, for which only heuristic solutions were unknown. We present an optimal polynomial time algorithm for combinational circuits under this model. Our algorithm can be generalized to solve the problem under any monotone clustering constraint.

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

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

U2 - 10.1145/157485.164907

DO - 10.1145/157485.164907

M3 - Conference contribution

AN - SCOPUS:0027247165

SN - 0897915771

SN - 9780897915779

T3 - Proceedings - Design Automation Conference

SP - 309

EP - 314

BT - Proceedings - Design Automation Conference

PB - Publ by IEEE

T2 - Proceedings of the 30th ACM/IEEE Design Automation Conference

Y2 - 14 June 1993 through 18 June 1993

ER -