Abstract
We consider the problem of running two large classes of algorithms (called “fan-in” and “uniform hypercube algorithms”) on a synchronous parallel processing environment in which processors are connected by a multiple bus network (MBN). We present two MBNs, F and U , that run fan-in and uniform hypercube algorithms optimally. We also show that the MBN U is highly resilient to bus faults. This coupled with the fact that uniform hypercube algorithms require a rich set of interconnections and find use in a variety of applications, makes U useful as a general purpose interconnection structure.
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.
