Bandwidth availability of multiple-bus multiprocessors
IEEE Transactions on Computers
Effective Memory Bandwidth and Processor Blocking Probability in Multiple-Bus Systems
IEEE Transactions on Computers
Overlapping connectivity interconnection networks for shared memory multiprocessor systems
Journal of Parallel and Distributed Computing
Classification Categories and Historical Development of Circuit Switching Topologies
ACM Computing Surveys (CSUR)
Mapping Parallel Application Communication Topology to Rhombic Overlapping-Cluster Multiprocessors
The Journal of Supercomputing
Routing Algorithms on the Bus-Based Hypercube Network
IEEE Transactions on Parallel and Distributed Systems
It’s elementary, my dear watson: time-optimal sorting algorithms on a completely overlapping network
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
| Hi-index | 14.98 |
Multiprocessor interconnection networks are proposed which have the characteristic that each processor or memory module can connect to a group of its near neighbors and adjacent directly connected groups include some of the same processors or memories. These overlapping connectivity networks are attractive especially for a very large number of processors which cannot be provided with full connectivity but need to operate by communication between processors. Applications for overlapping connectivity networks include neural computers and dataflow computers. Bandwidth formulas are derived using a probabilistic approach, including when intermediate processors are used in the interconnection path. A general cell design is presented capable of representing various overlapping connectivity networks.