Optimal clustering for delay minimization

Rajmohan Rajaraman, D. F. Wong

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish (US)
Title of host publicationProceedings - Design Automation Conference
PublisherPubl by IEEE
Pages309-314
Number of pages6
ISBN (Print)0897915771, 9780897915779
DOIs
StatePublished - Jan 1 1993
Externally publishedYes
EventProceedings of the 30th ACM/IEEE Design Automation Conference - Dallas, TX, USA
Duration: Jun 14 1993Jun 18 1993

Publication series

NameProceedings - Design Automation Conference
ISSN (Print)0146-7123

Other

OtherProceedings of the 30th ACM/IEEE Design Automation Conference
CityDallas, TX, USA
Period6/14/936/18/93

ASJC Scopus subject areas

  • Engineering(all)

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

Cite this