Empirical evaluation of deterministic and adaptive routing with constant-area routers

Author

Miller, D.R. ; Najjar, W.A.

Author_Institution

Dept. of Comput. Sci., Colorado State Univ., Fort Collins, CO, USA

fYear

1997

fDate

10-14 Nov 1997

Firstpage

64

Lastpage

75

Abstract

This paper addresses the issue of how router complexity affects the overall performance in deterministic and adaptive routing under virtual cut-through switching in k-ary n-cube networks. First, the performance of various adaptive routers with constant area are compared. Second, the performance of adaptive and deterministic routers are compared under the same conditions. Finally, it is shown that, under certain conditions, deterministic routers can reach saturation points comparable to adaptive routers

Keywords

adaptive systems; hypercube networks; network routing; performance evaluation; adaptive routing; constant-area routers; deterministic routing; hypercube networks; k-ary n-cube networks; performance; router complexity; saturation points; virtual cut-through switching; Algorithm design and analysis; Clocks; Computer science; Costs; Delay; Fault tolerance; Routing; Switches; System recovery;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Architectures and Compilation Techniques., 1997. Proceedings., 1997 International Conference on

Conference_Location

San Francisco, CA

Print_ISBN

0-8186-8090-3

Type

conf

DOI

10.1109/PACT.1997.644004

Filename

644004