http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Takhonov, I.I. (검색결과 1 건)
- 무료
- 기관 내 무료
- 유료
-
A provably tight delay-driven concurrently congestion mitigating global routing algorithm
Samanta, R.,Erzin, A.I.,Raha, S.,Shamardin, Y.V.,Takhonov, I.I.,Zalyubovskiy, V.V. Elsevier [etc.] 2015 Applied mathematics and computation Vol.255 No.-
Routing is a very important step in VLSI physical design. A set of nets are routed under delay and resource constraints in multi-net global routing. In this paper a delay-driven congestion-aware global routing algorithm is developed, which is a heuristic based method to solve a multi-objective NP-hard optimization problem. The proposed delay-driven Steiner tree construction method is of O(n<SUP>2</SUP>logn) complexity, where n is the number of terminal points and it provides n-approximation solution of the critical time minimization problem for a certain class of grid graphs. The existing timing-driven method (Hu and Sapatnekar, 2002) has a complexity O(n<SUP>4</SUP>) and is implemented on nets with small number of sinks. Next we propose a FPTAS Gradient algorithm for minimizing the total overflow. This is a concurrent approach considering all the nets simultaneously contrary to the existing approaches of sequential rip-up and reroute. The algorithms are implemented on ISPD98 derived benchmarks and the drastic reduction of overflow is observed.
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
