Title :
The Λ time slot permuter: a bit-controlled time slot permuter
Author :
Lee, Daeshik ; Lee, Kyungsook Y. ; Jordan, Harry F.
Author_Institution :
Dept. of Math. & Comput. Sci., Colorado Univ., Denver, CO, USA
Abstract :
The authors formulated a general method for constructing time slot permuters from spatial permutation networks. Using the method, they constructed a new time slot permuter, the Λ time-slot permuter. The Λ time slot permuter is obtained from the bit-controlled, self-routing permutation network, the Λ network. While the Λ time slot permuter requires more hardware than the time slot permuter based on the Benes network described by S.V. Ramanan et al. (1990), its control is very simple. In the Λ time slot permuter, a single bit from the destination tag in the first of a pair of time slots entering an exchange element is used as the control bit so that the switch setting can be done before the second time slot arrives; thus, it is possible that the switch setting does not incur any delay. The Λ time slot permuter is suitable for a class of applications where on-the-fly control of the time slot permuter is important, and is especially efficient for a pipelined operation
Keywords :
multiprocessing systems; multiprocessor interconnection networks; operating systems (computers); Λ network; pipelined operation; spatial permutation networks; time slot permuters; Bandwidth; Computer science; Delay effects; Educational technology; Hardware; Mathematics; Optical control; Switches; Time division multiplexing; Time domain analysis;
Conference_Titel :
Supercomputing '92., Proceedings
Conference_Location :
Minneapolis, MN
Print_ISBN :
0-8186-2630-5
DOI :
10.1109/SUPERC.1992.236690