ON the role of K-Bits bitonic sorting network in multicast routing

Author

Al-Hajery, Majed Z. ; Batcher, Kenneth E.

Author_Institution

Dept. of Math. & Comput. Sci., Kent State Univ., OH, USA

fYear

1994

fDate

26-29 Oct 1994

Firstpage

706

Lastpage

714

Abstract

Using both modified bit-level comparators and the bitonic sorting algorithm, three multicast routing networks are introduced. The first is dynamic network, which possess a time complexity of O(log² N) and cost complexity of O(N log N). The next two are Hypercube and 2D-MESH static topology networks. A new type of wormhole router is adopted to achieve a general multicast time complexity of O(log² N) and O(√N) for the Hypercube and 2D-MESH respectively

Keywords

computational complexity; hypercube networks; sorting; 2D-mesh static topology networks; K-Bits bitonic sorting network; cost complexity; dynamic networ; hypercube; modified bit-level comparators; multicast routing; time complexity; Computer science; Costs; Hypercubes; Intelligent networks; Mathematics; Multicast algorithms; Network topology; Routing; Sorting; Time measurement;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Processing, 1994. Proceedings. Sixth IEEE Symposium on

Conference_Location

Dallas, TX

Print_ISBN

0-8186-6427-4

Type

conf

DOI

10.1109/SPDP.1994.346105

Filename

346105

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2298470