Optimal clustering for delay minimization

Rajmohan Rajaraman, Martin 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
StatePublished - 1993
Externally publishedYes
EventProceedings of the 30th ACM/IEEE Design Automation Conference - Dallas, TX, USA
Duration: Jun 14 1993Jun 18 1993

Other

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

Fingerprint

Combinatorial circuits
Polynomials
Networks (circuits)

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Rajaraman, R., & Wong, M. D. F. (1993). Optimal clustering for delay minimization. In Proceedings - Design Automation Conference (pp. 309-314). Publ by IEEE.

Optimal clustering for delay minimization. / Rajaraman, Rajmohan; Wong, Martin D F.

Proceedings - Design Automation Conference. Publ by IEEE, 1993. p. 309-314.

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

Rajaraman, R & Wong, MDF 1993, Optimal clustering for delay minimization. in Proceedings - Design Automation Conference. Publ by IEEE, pp. 309-314, Proceedings of the 30th ACM/IEEE Design Automation Conference, Dallas, TX, USA, 6/14/93.
Rajaraman R, Wong MDF. Optimal clustering for delay minimization. In Proceedings - Design Automation Conference. Publ by IEEE. 1993. p. 309-314
Rajaraman, Rajmohan ; Wong, Martin D F. / Optimal clustering for delay minimization. Proceedings - Design Automation Conference. Publ by IEEE, 1993. pp. 309-314
@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, {Martin D F}",
year = "1993",
language = "English (US)",
isbn = "0897915771",
pages = "309--314",
booktitle = "Proceedings - Design Automation Conference",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Optimal clustering for delay minimization

AU - Rajaraman, Rajmohan

AU - Wong, Martin D F

PY - 1993

Y1 - 1993

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

M3 - Conference contribution

AN - SCOPUS:0027247165

SN - 0897915771

SP - 309

EP - 314

BT - Proceedings - Design Automation Conference

PB - Publ by IEEE

ER -