Self-routing control algorithms and the passability of random inputs by the base-line network

DOI10.1016/0020-0255(87)90034-XzbMath0634.94001OpenAlexW2011518941MaRDI QIDQ1097236

S. Lakshmivarahan, A. Y. Al-Hallaq

Publication date: 1987

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(87)90034-x

zbMATH Keywords

multistage interconnection networksaverage bandwidthbase-line networkpassable permutationsunique path network

Mathematics Subject Classification ID

Theory of operating systems (68N25) Communication theory (94A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interference Analysis of Shuffle/Exchange Networks
• Access and Alignment of Data in an Array Processor
• On the Rearrangeability of 2(Iog₂N) –1 Stage Permutation Networks
• Parallel Processing with the Perfect Shuffle

This page was built for publication: Self-routing control algorithms and the passability of random inputs by the base-line network