Efficient Schemes for Parallel Communication
Journal of the ACM (JACM)
Interconnection networks for large-scale parallel processing: theory and case studies
Interconnection networks for large-scale parallel processing: theory and case studies
Fault-Tolerant Multiprocessors with Redundant-Path Interconnection Networks
IEEE Transactions on Computers - The MIT Press scientific computation series
On the permutation capability of multistage interconnection networks
IEEE Transactions on Computers
Randomized parallel communications on an extension of the omega network
Journal of the ACM (JACM)
Tight bounds on the complexity of parallel sorting
IEEE Transactions on Computers
An O(logN) deterministic packet routing scheme
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Space-efficient message routing in c-decomposable networks
SIAM Journal on Computing
A time-randomness trade-off for oblivious routing
SIAM Journal on Computing
Improved routing strategies with succinct tables
Journal of Algorithms
Fast, Deterministic Routing, on Hypercubes, Using Small Buffers
IEEE Transactions on Computers
On-line algorithms for path selection in a nonblocking network
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Deterministic sorting in nearly logarithmic time on the hypercube and related computers
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Journal of Parallel and Distributed Computing
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Framework for Analyzing Locality and Portability Issues in Parallel Computing
Proceedings of the First Heinz Nixdorf Symposium on Parallel Architectures and Their Efficient Use
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Randomized parallel communication (Preliminary Version)
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Mathematical theory of multistage interconnection networks analysis
Mathematical theory of multistage interconnection networks analysis
On Routing Maskable Messages in Hypercube-Derived Multistage Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
Considers a strategy for dealing with communication conflicts in omega networks. Specifically, the authors consider the problem of partitioning a set of conflicting messages into a minimum number of subsets, called rounds, each free of communication conflicts. In addition to standard omega networks, they consider this problem for a more general class of networks called bundled omega networks, where interconnection links in the network are replaced by bundles of wires. Although the partitioning problem has previously been considered in the literature, its computational complexity has remained open. The authors show that for a number of cases, the problem is NP-complete, but for certain special cases, it is solvable in polynomial time. In addition, they present a class of distributed, on-line heuristics for the problem. Finally, they give a lower bound of /spl Omega/(log N) on the performance ratio for one of these heuristics.