An analysis of algorithm-based fault tolerance techniques
Journal of Parallel and Distributed Computing
Topological Properties of Hypercubes
IEEE Transactions on Computers
Reliable Broadcast in Hypercube Multicomputers
IEEE Transactions on Computers
Routing and broadcasting in faulty hypercube computers
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Block-matrix operations using orthogonal trees
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
The technology of parallel processing: parallel processing architectures and VLSI hardware (vol. 1)
The technology of parallel processing: parallel processing architectures and VLSI hardware (vol. 1)
Running algorithms efficiently on faulty hypercubes (extended abstract)
ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures
A Fault-Tolerant Communication Scheme for Hypercube Computers
IEEE Transactions on Computers
A large scale, homogeneous, fully distributed parallel machine, I
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
Routing Algorithms on the Bus-Based Hypercube Network
IEEE Transactions on Parallel and Distributed Systems
Journal of Parallel and Distributed Computing
Efficient data gathering schemes for wireless sensor networks
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
| Hi-index | 14.98 |
The tree communication scheme was shown to be very efficient for global operations on data residing in the processors of a hypercube with time complexity of O(log2N), where N is the number of processors. This communication scheme is very useful for many parallel algorithms on hypercube multiprocessors. If a problem can be divided into independent subproblems, each subproblem can first be solved by one of the processors. Then, the tree communication scheme is invoked to merge the subresults into the final results. All the algorithms for problems with this property can benefit from the tree communication scheme. We propose a more general and efficient tree communication scheme in this paper. In addition, we also propose fault-tolerant algorithms for the tree communication scheme, by exploiting the unique properties of the tree communication scheme. The computation and communication slowdown is small (