A Pyramid-Based Approach to Segmentation Applied to Region Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
Communication effect basic linear algebra computations on hypercube architectures
Journal of Parallel and Distributed Computing
IEEE Transactions on Computers
Information and Computation
Reliable Broadcast in Hypercube Multicomputers
IEEE Transactions on Computers
Supercomputers and artificial intelligence machines
Computer architecture
Optimal communication algorithms for regular decompositions on the hypercube
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Cascading divide-and-conquer: a technique for designing parallel algorithms
SIAM Journal on Computing
Scans as Primitive Parallel Operations
IEEE Transactions on Computers
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Journal of Parallel and Distributed Computing - Special issue: algorithms for hypercube computers
On the performance of concurrent tree algorithms
Journal of Parallel and Distributed Computing
Performance Analysis of k-ary n-cube Interconnection Networks
IEEE Transactions on Computers
Communication in network architectures
VLSI and parallel computation
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Tolerating Faults in Hypercubes Using Subcube Partitioning
IEEE Transactions on Computers - Special issue on fault-tolerant computing
A VLSI Architecture for Concurrent Data Structures
A VLSI Architecture for Concurrent Data Structures
Data Structures and Algorithms
Data Structures and Algorithms
A new look at fault tolerant network routing
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
On the Scalability of 2-D Discrete Wavelet Transform Algorithms
Multidimensional Systems and Signal Processing
| Hi-index | 0.00 |
The paper presents a simple and effective method for the concurrent manipulation oflinearly ordered data structures on hypercube systems. The method Is based on theexistence of an augmented binomial search tree, called the pruned binomial tree, rootedat any arbitrary processor node of the hypercube such that; every edge of the treecorresponds to a direct link between a pair of hypercube nodes; and the tree spans anyarbitrary sequence of n consecutive nodes containing the root, using a fanout of at most[log/sub 2/ n] and a depth of at most [log/sub 2/ n]+1. Search trees spanningnonoverlapping processor lists are formed using only local information, and can be usedconcurrently without contention problems. Thus, they can be used for performingoperations such as broadcast and merge simultaneously on sets with nonuniform sizes.Extensions of the tree to k-ary n-cubes and faulty hypercubes are presented.Applications of this concurrent data structure to low- and intermediate-level imageprocessing algorithms, and for dictionary operations involving multiple keys, are alsooutlined.