Single-row Routing Algorithm with Between Node Congestion

간노드과잉을 고려한 단층 열 라우팅 알고리즘

  • 이남일 (동의공업전문대학 전자계산과) ;
  • 이상조 (경북대학교 전자공학과)
  • Published : 1987.04.01

Abstract

In this paper, the single-row routing algorithm for munimizing the street congestion and reducing the between node congestion is deviced. To reduce the between node congestion, reference line crossing is defined and used. Reducing the number of total reference line crossing means reducing the total length which help reduce the power consumption of the integrated system and reducing the between node congestin which help reduce the wiring area. This algorithm has been implemented and tested with various example, then produced good results.

Keywords