Title :
On the rearrangeability of switching networks composed of digital symmetrical matrices
Author :
Huynh, Dung T. ; Nguyen, Hai N.
Author_Institution :
Comput. Sci. Program, Texas Univ., Dallas, TX, USA
Abstract :
This paper studies the rearrangeability of switching networks composed of digital symmetrical matrices (DSM networks). We describe an efficient rearrangement algorithm for rearrangeable DSM networks with O(r2) time complexity, where r is the number of input (output) switches. We also show that r-1 is an upper bound an the number of existing connections that need to be rearranged in order to realize a connection request
Keywords :
computational complexity; matrix algebra; multiprocessor interconnection networks; reconfigurable architectures; symmetric switching functions; DSM networks; connection request; digital symmetrical matrices; rearrangeability; switching networks; time complexity; Computer science; Phase change materials; Space technology; Sufficient conditions; Switches; Symmetric matrices; Upper bound;
Conference_Titel :
Computing and Information, 1993. Proceedings ICCI '93., Fifth International Conference on
Conference_Location :
Sudbury, Ont.
Print_ISBN :
0-8186-4212-2
DOI :
10.1109/ICCI.1993.315387
