Presentation 1999/8/5
A Parallel Routing Algorithm with Indipendent Global and Detailed Routing
Kotaro Tanaka, Kazuhiko Ohno, Hiroshi Nakashima,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper propose a new algorithm in which the global and detailed routers work independently. In this algorithm, a set of virtual paths called capacity path to maximize local wireability is obtained prior to global routing. Then global router which choose the capacity paths to form a global paths is able to work independently of detailed router. Thus the method is simplified and also decreases number of messages compared with existing algorithms.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) CAD / MCM / wire routing / parallel algorithm / global / detailed
Paper # CPSY99-69
Date of Issue

Conference Information
Committee CPSY
Conference Date 1999/8/5(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Computer Systems (CPSY)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Parallel Routing Algorithm with Indipendent Global and Detailed Routing
Sub Title (in English)
Keyword(1) CAD
Keyword(2) MCM
Keyword(3) wire routing
Keyword(4) parallel algorithm
Keyword(5) global
Keyword(6) detailed
1st Author's Name Kotaro Tanaka
1st Author's Affiliation Dept.of Computer Science,Toyohashi University of Technorogy()
2nd Author's Name Kazuhiko Ohno
2nd Author's Affiliation Dept.of Computer Science,Toyohashi University of Technorogy
3rd Author's Name Hiroshi Nakashima
3rd Author's Affiliation Dept.of Computer Science,Toyohashi University of Technorogy
Date 1999/8/5
Paper # CPSY99-69
Volume (vol) vol.99
Number (no) 252
Page pp.pp.-
#Pages 8
Date of Issue