By Topic

Low cost complexity of a general multicast network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Al-Hajery, M.Z. ; Dept. of Math. & Comput. Sci., Kent State Univ., OH, USA ; Batcher, K.E.

This paper presents a new multicasting network constructed with a bit-level cost complexity of O(N log N) and a bit-level time complexity of O(log 2 N) using comparators with bit-level O(1) time and cost complexities. The requested addresses for connection and the addresses of the source nodes to be connected to, are sorted together in a pipeline fashion (worm-hole routed) bit-serially most-significant-bit first through the network. This network achieves sorting by recirculating its inputs through its 3(1+log N) stages. Input items of the network are constructed of leading addresses (request or adversely nodes addresses), return addresses, and data packets. Packets are broadcast during the process of sorting between two equal leading addresses

Published in:

Parallel Processing Symposium, 1994. Proceedings., Eighth International

Date of Conference:

26-29 Apr 1994