A parallel execution model for logic programming
A parallel execution model for logic programming
Discrete Optimization Problem in Local Networks and Data Alignment
IEEE Transactions on Computers
The de Bruijn multiprocessor network: a versatile sorting network
ISCA '85 Proceedings of the 12th annual international symposium on Computer architecture
Tree machines and divide-and-conquer algorithms
CONPAR '81 Proceedings of the Conference on Analysing Problem Classes and Programming for Parallel Computing
Optimal processor interconnection topologies
ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture
Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
De bruijn communications networks.
De bruijn communications networks.
Optimal Layouts of Midimew Networks
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 14.98 |
A generic approach to constructing the topology of fixed degree directed networks for a given node degree and size is proposed. The topology has minimum diameter and makes it possible to answer Maekawa's problem partially. In addition, an expansion operator Ex(x,n) is provided to scale the network size. Fast routing algorithms for these networks that have logarithmic time complexity while using constant buffer size are presented.