Communications of the ACM - Special section on computer architecture
Comments on "Reliable Loop Topologies for Large Local Computer Networks"
IEEE Transactions on Computers
Optimized mesh-connected networks for SIMD and MIMD architectures
ISCA '87 Proceedings of the 14th annual international symposium on Computer architecture
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Fine grain concurrent computations
Fine grain concurrent computations
Discrete Optimization Problem in Local Networks and Data Alignment
IEEE Transactions on Computers
Spanning Multiaccess Channel Hypercube Computer Interconnection
IEEE Transactions on Computers
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
A framework for adaptive routing in multicomputer networks
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
An optimization problem in distributed loop computer networks
Proceedings of the third international conference on Combinatorial mathematics
Doubly twisted torus networks for VLSI processor arrays
ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture
The C Programmer''s Abbreviated Guide to Multicomputer Programming
The C Programmer''s Abbreviated Guide to Multicomputer Programming
On the Performance of k-ary n-cube Interconnection Networks
On the Performance of k-ary n-cube Interconnection Networks
Optimal Layouts of Midimew Networks
IEEE Transactions on Parallel and Distributed Systems
A new method to make communication latency uniform: distributed routing balancing
ICS '99 Proceedings of the 13th international conference on Supercomputing
Improving parallel system performance by changing the arrangement of the network links
Proceedings of the 14th international conference on Supercomputing
Recursive Diagonal Torus: An Interconnection Network for Massively Parallel Computers
IEEE Transactions on Parallel and Distributed Systems
A Proxy-Network Based Overlay Topology Resistant to DoS Attacks and Partitioning
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 16 - Volume 17
An optimal message routing algorithm for circulant networks
Journal of Systems Architecture: the EUROMICRO Journal
Routing direction determination in regular networks based on configurable circuits
Future Generation Computer Systems
Dense Gaussian networks: suitable topologies for on-chip multiprocessors
International Journal of Parallel Programming
Optimal routing in double loop networks
Theoretical Computer Science
Algorithmic and explicit determination of the Lovász number for certain circulant graphs
Discrete Applied Mathematics
Routing direction determination in regular networks based on configurable circuits
Future Generation Computer Systems
Self-healing in binomial graph networks
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems - Volume Part II
On finding a shortest path in circulant graphs with two jumps
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
INSEE: an interconnection network simulation and evaluation environment
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Efficient computation of the lovász theta function for a class of circulant graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Dense bipartite circulants and their routing via rectangular twisted torus
Discrete Applied Mathematics
On the partition dimension of a class of circulant graphs
Information Processing Letters
| Hi-index | 14.98 |
The authors introduce and study a family of interconnection schemes, the Midimew networks, based on circulant graphs of degree 4. A family of such circulants is determined and shown to be optimal with respect to two distance parameters simultaneously, namely maximum distance and average distance, among all circulants of degree 4.. These graphs are regular, point-symmetric, and maximally connected, and one such optimal graph exists for any given number of nodes. The proposed interconnection schemes consist of mesh-connected networks with wrap-around links, and are isomorphic to the optimal distance circulants previously considered. Ways to construct one such network for any number of nodes are shown, their good properties to build interconnection schemes for multicomputers are examined, and some interesting particular cases are discussed. The problem of routing is also addressed, and a basic algorithm is provided which is adequate for implementing the routing policy required to convey messages, traversing shortest paths between nodes.