Optimal clustering for delay minimization

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 known. We present an optimal polynomial time algorithm for combinational circuits under this model. Our algorithm ca...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	30th ACM/IEEE Design Automation Conference s. 309 - 314
Hlavní autoři:	Rajaraman, Rajmohan, Wong, D. F.
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	New York, NY, USA ACM 01.07.1993
Edice:	ACM Conferences
Témata:	Bridge circuits Clustering algorithms Combinational circuits Delay effects Hardware > Electronic design automation > Physical design (EDA) > Partitioning and floorplanning Hardware > Integrated circuits > Logic circuits > Combinational circuits Hardware > Very large scale integration design > Application-specific VLSI designs Integrated circuit interconnections Joining processes Mathematics of computing > Discrete mathematics > Graph theory > Network flows Minimization Partitioning algorithms Polynomials Theory of computation > Computational complexity and cryptography Theory of computation > Computational complexity and cryptography > Complexity classes Theory of computation > Design and analysis of algorithms > Graph algorithms analysis > Network flows Theory of computation > Randomness, geometry and discrete structures Timing
ISBN:	9780897915779, 0897915771
ISSN:	0738-100X
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!