Now showing items 1-2 of 2

    • Area-Universal Interconnection Networks for VLSI Parallel Computers 

      Bay, Paul Edwin (Cornell University, 1992-05)
      A central issue in the design of a general-purpose parallel computer is the choice of an interconnection network and an associated algorithm for routing messages through it. The main results of this thesis are two new ...
    • Deterministic On-Line Routing on Area-Universal Networks 

      Bay, Paul Edwin; Bilardi, Gianfranco (Cornell University, 1991-09)
      Two deterministic routing networks are presented: the pruned butterfly and the sorting fattree. Both networks are area-universal, i.e., they can simulate any other routing network fitting in similar area with polylogarithmic ...