
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
C.s. Raghavendra, M.a. Sridhar, "Global Commutative and Associative Reduction Operations in Faulty SIMD Hypercubes," IEEE Transactions on Computers, vol. 45, no. 4, pp. 495498, April, 1996.  
BibTex  x  
@article{ 10.1109/12.494109, author = {C.s. Raghavendra and M.a. Sridhar}, title = {Global Commutative and Associative Reduction Operations in Faulty SIMD Hypercubes}, journal ={IEEE Transactions on Computers}, volume = {45}, number = {4}, issn = {00189340}, year = {1996}, pages = {495498}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.494109}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Global Commutative and Associative Reduction Operations in Faulty SIMD Hypercubes IS  4 SN  00189340 SP495 EP498 EPD  495498 A1  C.s. Raghavendra, A1  M.a. Sridhar, PY  1996 KW  Hypercubes KW  fault tolerance KW  global sum KW  algorithms KW  dimension ordering. VL  45 JA  IEEE Transactions on Computers ER   
Abstract—We consider the problem of computing a global commutative and associative operation, also known as semigroup operation, (such as addition and multiplication) on a faulty hypercube. In particular, we study the problem of performing such an operation in an
Given a set of at most
[1] Al Dhelaan and B. Bose,"Efficient FaultTolerant Broadcasting on the Hypercube," Proc. Fourth Conf. Hypercube Concurrent Computers and Applications, 1989.
[2] B. Becker and H. Simon,“How robust is the ncube?” Information and Computation, pp. 162178, 1988.
[3] J. Bruck, R. Cypher, and D. Soroker, "Tolerating Faults in Hypercubes Using Subcube Partitioning," IEEE Trans. Computers, vol. 41, no. 5, pp. 599605, May 1992.
[4] M.S. Chen and K. Shin, "Message Routing in an Injured Hypercube," Proc. Third Conf. Hypercube Concurrent Computers and Their Applications, pp. 312317, 1988.
[5] J. Hastad,T. Leighton,, and M. Newman,“Fast computation using faulty hypercubes,” Proc. 21st ACM Symp. Theory of Computing, 1989.
[6] S.M. Hedetniemi,S.T. Hedetniemi, and A.L. Liestman,"A Survey of Gossiping and Broadcasting in Communication Networks," Networks, vol. 18, pp. 319349, 1988.
[7] T.C. Lee and J.P. Hayes, "Routing and Broadcasting in Faulty Hypercube Computers," Proc. Third Conf. Hypercube Concurrent Computers and Applications, pp. 625630, 1988.
[8] C.S. Raghavendra and M.A. Sridhar, "Broadcasting Algorithms in Faulty SIMD Hypercubes," Proc. Fourth IEEE Symp. Parallel and Distributed Processing, pp. 411, Dec. 1992.
[9] P. Ramanathan and K.G. Shin, "Reliable Broadcast in Hypercube Multicomputers," IEEE Trans. Computers, vol. 37, no. 12, pp. 1,6541,657, Dec. 1988.
[10] E.M. Reingold,J. Nievergelt, and N. Deo,Combinatorial Algorithms. Prentice Hall, 1977.
[11] Y. Saad and M.H. Schultz,"Topological Properties of Hypercubes," Research Report 389, Dept. of Computer Science, Yale Univ., June 1985.