Discrete Optimization Problem in Local Networks and Data Alignment
- 1 June 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-36 (6) , 702-713
- https://doi.org/10.1109/tc.1987.1676963
Abstract
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.Keywords
This publication has 11 references indexed in Scilit:
- Discrete Optimization Problem in Local Networks and Data AlignmentIEEE Transactions on Computers, 1987
- Combinatorial optimization problems in the analysis and design of probabilistic networksNetworks, 1985
- Double Loop Network Architectures--A Performance StudyIEEE Transactions on Communications, 1985
- Reliable Loop Topologies for Large Local Computer NetworksIEEE Transactions on Computers, 1985
- The Prime Memory System for Array AccessIEEE Transactions on Computers, 1982
- Theoretical Limitations on the Efficient Use of Parallel MemoriesIEEE Transactions on Computers, 1978
- An introduction to local area networksProceedings of the IEEE, 1978
- Access and Alignment of Data in an Array ProcessorIEEE Transactions on Computers, 1975
- Interconnections for Parallel Memories to Unscramble p-Ordered VectorsIEEE Transactions on Computers, 1974
- A Combinatorial Problem Related to Multimodule Memory OrganizationsJournal of the ACM, 1974