2000 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '00)
Pipelining Router Design Improves Parallel System Performance
Dallas/Richardson, Texas, USA
December 07-December 07
ISBN: 0-7695-0936-3
Abstract-Efficient communication on fetching remote data is a critical parameter in distributed shared-memory multiprocessors (DSM) in order to achieve high performance. Message-passing techniques are used in many modern communication systems and routers are essential building blocks for these communication systems. Hence, in this paper emphasis is placed on the design of routers for 2-ary n-cube networks. Based on a simple dead- lock free algorithm, we analyze the influence of the router structure. To be more precise, the parameters considered were the clock frequency and the number of pipeline stages of the router. The performance evaluation for DSM applications shows there are significant gains in using segmented routers designs. In our evaluations, results show an improvement of up to 12% in the execution time of some applications. This improvement occurs even though the base latency of the router has increased by 40%.
Index Terms:
DSM systems, k-ary n-cube networks, bubble algorithm, pipelined router design
Citation:
C. Carrion, J. Gregorio, R. Beivide, "Pipelining Router Design Improves Parallel System Performance," ispan, pp.195, 2000 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '00), 2000