Issue No. 12 - December (1994 vol. 43)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.338095
<p>This paper shows that a fat-pyramid of area /spl Theta/(A) requires only O(log A) slowdown to simulate any competing network of area A under very general conditions. The result holds regardless of the processor size (amount of attached memory) and number of processors in the competing networks as long as the limitation on total area is met. Furthermore, the result is valid regardless of the relationship between wire length and wire delay. We especially focus on elimination of the common simplifying assumption that unit time suffices to traverse a wire regardless of its length, since the assumption becomes more and more untenable as the size of parallel systems increases. This paper concentrates on simulation using transmission lines (wires along which bits can be pipelined) with the message routing schedule set up off line, but it also discusses the extension to on-line simulation. This paper also examines the capabilities of a fat-pyramid when matched against a substantially larger network and points out the surprising difficulty of doing such a comparison without the unit wire delay assumption.</p>
multiprocessor interconnection networks; parallel architectures; fat pyramid; universal parallel computation; wire delay; processor size; wire length; simulation; unit wire delay; fat-tree; parallel computation; routing networks; universality.
R. Greenberg, "The Fat-Pyramid and Universal Parallel Computation Independent of Wire Delay," in IEEE Transactions on Computers, vol. 43, no. , pp. 1358-1364, 1994.