Title :
A Parallel Algorithm to Construct BISTs on Parity Cubes
Author :
Yan Wang ; Jianxi Fan ; Wenjun Liu ; Yuejuan Han
Author_Institution :
Sch. of Comput. Sci. & Technol., Soochow Univ., Suzhou, China
Abstract :
Independent spanning trees(ISTs) have applications in interconnection networks such as reliable communication protocols, and secure message distribution, etc. In this paper, we use BIST to denote the IST isomorphic to binomial-like tree. We propose an algorithm to construct n BISTs and the algorithm can be parallelized on PQn to run in O(N) time, where N = 2n.
Keywords :
parallel algorithms; IST isomorphic; binomial-like tree; construct BIST; independent spanning trees; interconnection networks; parallel algorithm; parity cubes; reliable communication protocols; secure message distribution; Broadcasting; Built-in self-test; Computer network reliability; Computer science; Hypercubes; Reliability; Algorithm; Binomial-like tree; Independent spanning trees; Interconnection networks;
Conference_Titel :
Information Science and Control Engineering (ICISCE), 2015 2nd International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4673-6849-0
DOI :
10.1109/ICISCE.2015.21
