Abstract
Abstract : The demand for computers with ever greater throughput coupled with the decreased costs accompanying advances in semiconductor technology has created a great deal of interest in parallel processing systems. Single instruction stream - multiple data stream (SIMD) machines and multiple instruction stream - multiple data stream (MIMD) machines are two types of parallel processing system architectures. PASM is a partitionable SIMD/MIMD parallel processor, intended to operate in either mode of parallelism, being developed at Purdue University. The interconnection network chosen for this system will greatly influence its performance. The Generalized Cube and the Augmented Data Manipulator (ADM) are two networks being considered for use in PASM. This work is primarily concerned with the capabilities of the ADM network in SIMD mode. The number of data permutations passable by the ADM network is explored. Routing tag schemes are described for both the Generalized Cube and ADM networks. Algorithms for determining permutation passability in the ADM network using three related types of routing tags for distributed network control are presented. Correctness proofs are given and algorithm complexity determined. To further investigate ADM network capabilities in SIMD mode, group theory is used to derive additional properties. It is shown that the ADM network cannot pass all even permutations when N or = 8.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
