Clustering-based optimization algorithm in zero-skew routings

Masato Edahiro*

*Corresponding author for this work

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

61 Citations (Scopus)

Abstract

A zero-skew routing algorithm with clustering and improvement methods is proposed. This algorithm generates a zero-skew routing in O(n log n) time for n pins, and its proven that the order of the total wire length is best possible. Our algorithm achieves 20% reduction of the total wire length on benchmark data compared with the best known algorithm.

Original languageEnglish
Title of host publicationProceedings - Design Automation Conference
PublisherPubl by IEEE
Pages612-616
Number of pages5
ISBN (Print)0897915771
Publication statusPublished - 1993
Externally publishedYes
EventProceedings of the 30th ACM/IEEE Design Automation Conference - Dallas, TX, USA
Duration: 1993 Jun 141993 Jun 18

Publication series

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

Conference

ConferenceProceedings of the 30th ACM/IEEE Design Automation Conference
CityDallas, TX, USA
Period93/6/1493/6/18

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint

Dive into the research topics of 'Clustering-based optimization algorithm in zero-skew routings'. Together they form a unique fingerprint.

Cite this