Hypercube sandwich approach to conferencing |
| |
Authors: | Joanne F Houlahan Lenore J Cowen Gerald M Masson |
| |
Affiliation: | (1) Computer Science Department, The Johns Hopkins University, 21218 Baltimore, MD, USA |
| |
Abstract: | This paper presents a novel cascaded conference network that provides distributed processing and signal transmission among members of disjoint sets of generic send/receive devices called conferees. It assumes an online request model in which idle groups of conferees may request the formation of a conference interconnection. Once a conference is established, all conferees remain connected until the entire conference is dissolved. The Hypercube Sandwich Network (HSN) consists of two components. A bidirectional permutation network is used for routing purposes to and from a hypercube of special processing elements for the purpose of conference formation. The HSN achieves strictly nonblocking performance for N conferees using O(Nlog N) processing elements, and this is shown to be tight to within a log 1/4
N factor. Previous constructions required a quadratic number of processing elements for strictly nonblocking performance or could only provide wide-sense nonblocking conferencing. If the stronger requirement is made that the communication delay is logarithmic in the conference size, a simple algorithm is presented for wide-sense nonblocking conferencing in an HSN with O(N log N) processing elements.An earlier version of this paper was presented at the 1995 International Conference on Parallel Processing Techniques and Applications. |
| |
Keywords: | Hypercube conference nonblocking dynamic networks |
本文献已被 SpringerLink 等数据库收录! |