• DocumentCode
    2662727
  • Title

    A parallel switchbox router PARA-CONDOR

  • Author

    Watanabe, Toshimasa ; Oda, Takahiro ; Onaga, Kenji

  • Author_Institution
    Fac. of Eng., Hiroshima Univ., Higashi-Hiroshima, Japan
  • fYear
    1990
  • fDate
    1-3 May 1990
  • Firstpage
    2601
  • Abstract
    A parallel switchbox router, called PARA-CONDOR, that runs an array of processors controlled by a host computer is proposed. Parallelization of congestion cost directedness distinguishes PARA-CONDOR from other parallel routers. The routing algorithm is based on congestion costs assigned on vertices: it finds a solution by iteration of searching paths of minimum total congestion costs between pairs of actual or virtual terminals, forming nets by assigning them one by one to each pair of terminals, and then correcting congestion costs for the resolution of bottlenecks (or conflicts) in path assignment
  • Keywords
    circuit layout CAD; iterative methods; parallel algorithms; PARA-CONDOR; bottlenecks; congestion cost directedness; iteration; parallel switchbox router; path assignment; routing algorithm; virtual terminals; Communication switching; Concurrent computing; Costs; Microprocessors; Partitioning algorithms; Process control; Routing; Terminology; Very large scale integration;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 1990., IEEE International Symposium on
  • Conference_Location
    New Orleans, LA
  • Type

    conf

  • DOI
    10.1109/ISCAS.1990.112541
  • Filename
    112541