IEEE Transactions on Computers
An optimization problem in distributed loop computer networks
Proceedings of the third international conference on Combinatorial mathematics
A Combinatorial Problem Related to Multimodule Memory Organizations
Journal of the ACM (JACM)
Reliable Loop Topologies for Large Local Computer Networks
IEEE Transactions on Computers
Analysis of Chordal Ring Network
IEEE Transactions on Computers
The Prime Memory System for Array Access
IEEE Transactions on Computers
Theoretical Limitations on the Efficient Use of Parallel Memories
IEEE Transactions on Computers
Interconnections for Parallel Memories to Unscramble p-Ordered Vectors
IEEE Transactions on Computers
Access and Alignment of Data in an Array Processor
IEEE Transactions on Computers
Optimal Distance Networks of Low Degree for Parallel Computers
IEEE Transactions on Computers
Analyzing the fault tolerance of double-loop networks
IEEE/ACM Transactions on Networking (TON)
The Minimum Distance Diagram of Double-Loop Networks
IEEE Transactions on Computers
A complementary survey on double-loop networks
Theoretical Computer Science
On Optimizing Diameter and Average Distance of Directed Interconnected Networks
IEEE Transactions on Computers
A simple algorithm to find the steps of double-loop networks
Discrete Applied Mathematics
A survey on multi-loop networks
Theoretical Computer Science
Permutation routing in double-loop networks: design and empirical evaluation
Journal of Systems Architecture: the EUROMICRO Journal
A symbolical algorithm on additive basis and double-loop networks
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
An Optimal Fault-Tolerant Routing Algorithm for Weighted Bidirectional Double-Loop Networks
IEEE Transactions on Parallel and Distributed Systems
An optimal message routing algorithm for circulant networks
Journal of Systems Architecture: the EUROMICRO Journal
Dense Gaussian networks: suitable topologies for on-chip multiprocessors
International Journal of Parallel Programming
An efficient algorithm to find a double-loop network that realizes a given L-shape
Theoretical Computer Science
Optimal routing in double loop networks
Theoretical Computer Science
Restricted shortest paths in 2-circulant graphs
Computer Communications
Enumeration of 2-regular circulant graphs and directed double networks
Discrete Applied Mathematics
Improved upper and lower bounds on the optimization of mixed chordal ring networks
Information Processing Letters
Infinite families of optimal double-loop networks
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
An algorithm to find optimal double-loop networks with non-unit steps
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
On the wide diameter of directed double-loop networks
Journal of Network and Computer Applications
The network balance realized by routing organization system
KES-AMSTA'11 Proceedings of the 5th KES international conference on Agent and multi-agent systems: technologies and applications
A constant time optimal routing algorithm for undirected double-loop networks
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Theoretical Computer Science
Hi-index | 15.00 |
This paper presents the solution of the following optimization problem that appears in the design of double-loop structures for local networks and also in data memory, allocation and data alignment in SIMD processors.