
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Amit Sengupta, C.s. Raghavendra, "AllToAll Broadcast and Matrix Multiplication in Faulty SIMD Hypercubes," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 6, pp. 550560, June, 1998.  
BibTex  x  
@article{ 10.1109/71.689442, author = {Amit Sengupta and C.s. Raghavendra}, title = {AllToAll Broadcast and Matrix Multiplication in Faulty SIMD Hypercubes}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {9}, number = {6}, issn = {10459219}, year = {1998}, pages = {550560}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.689442}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  AllToAll Broadcast and Matrix Multiplication in Faulty SIMD Hypercubes IS  6 SN  10459219 SP550 EP560 EPD  550560 A1  Amit Sengupta, A1  C.s. Raghavendra, PY  1998 KW  SIMD hypercube KW  fault tolerance KW  dimension ordering KW  alltoall broadcast KW  broadcast KW  global sum KW  matrix multiplication. VL  9 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—In this paper, we develop algorithms in order of efficiency for alltoall broadcast problem in an
[1] B. Abali, F. Özgüner, and A. Bataineh, “Balanced Parallel Sort on Hypercube Multiprocessors,” IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 5, pp. 572581, May 1993.
[2] C. Aykanat, F. Ozguner, F. Ercal, and P. Sadayappan, “Iterative Algorithms for Solution of Large Sparse Systems of Linear Equations on Hypercubes,” IEEE Trans. Computers, vol. 37, no. 12, pp. 1,554–1,567, Dec. 1988.
[3] B. Becker and H. Simon,“How robust is the ncube?” Information and Computation, pp. 162178, 1988.
[4] D. Bertsekas, C. Ozveren, G. Stamoulis, P. Tseng, and J. Tsitsiklis, "Optimal Communication Algorithms for Hypercubes," J. Parallel and Distributed Computing, vol. 11, pp. 263275, 1991.
[5] 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.
[6] S. Dutt and N.R. Mahapatra, "Parallel A* Algorithms and Their Performance on Hypercube Multiprocessors," Proc. Seventh Int'l Parallel Processing Symp., pp. 797803, 1993.
[7] G. Foxet al.,Solving Problems on Concurrent Processors, vol. I. Englewood Cliffs, NJ: Prentice Hall, 1988.
[8] P. Fraigniaud, "Asymptotically Optimal Broadcasting and Gossiping in Faulty Hypercube Multicomputers," IEEE Trans. Computers, vol. 41, no. 11, pp. 1,4101,419, Nov. 1992.
[9] G.A. Geist and M.T. Heith, "Matrix Factorization on a Hypercube Multiprocessor," Hypercube Multiprocessors, pp. 161180, 1986.
[10] J. Hastad,T. Leighton,, and M. Newman,“Fast computation using faulty hypercubes,” Proc. 21st ACM Symp. Theory of Computing, 1989.
[11] W.D. Hillis, The Connection Machine, MIT Press, Cambridge, Mass., 1985.
[12] C.T. Ho, S.L. Johnsson, and A. Edelman, "Matrix Multiplication on Hypercubes Using Full Bandwidth and Constant Storage," Proc. 1991 Int'l Conf. Parallel Processing, pp. 447451, 1991.
[13] C.T. Ho and M.Y. Kao, "Optimal Broadcast in AllPort WormholeRouted Hypercubes," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 2, pp. 200318, Feb. 1995.
[14] O.H. Ibarra, T.C. Pong, and S.M. Sohn, "Parallel Recognition and Parsing on the Hypercube," IEEE Trans. Computers, vol. 40, no. 6, pp. 764770, June 1991.
[15] S.L. Johnsson, "Communication Efficient Basic Linear Algebra Computations on Hypercube Architectures," J. Parallel and Distributed Computing, vol. 4, pp. 133172, 1987.
[16] S.L. Johnsson and C.T. Ho,“Spanning graphs for optimum broadcasting and personalizedcommunication in hypercubes,” IEEE Trans. Computers, vol. 38, no. 9, pp. 1,2491,268, Sept. 1989.
[17] V. Kumar, A. Grama, A. Gupta, and G. Karypis, Introduction to Parallel Computing: Design and Analysis of Algorithms. Benjamin Cummings, 1994.
[18] W. Lin and V.K. Prasanna Kumar,“Efficient histogramming on hypercube SIMD machines,” Computer Vision, Graphics, and Image Processing, vol. 49, pp. 104120, 1990.
[19] Q.M. Malluhi,M.A. Bayoumi, and T.R.N. Rao,"Efficient Mapping of ANNs on Hypercube Massively Parallel Machines," IEEE Trans. Computers, vol. 44, no. 6, pp. 769779, June 1995.
[20] S. Nugent, "The iPSC/2 DirectConnect Communications Technology," Proc. Third Conf. Hypercube Concurrent Computers and Applications, pp. 5160, Jan. 1998.
[21] M.J. Quinn, "Analysis and Implementation of Branch and Bound Algorithms on a Hypercube Multicomputer," IEEE Trans. Computers, 1989.
[22] 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.
[23] C.S. Raghavendra and M.A. Sridhar, "Global SemiGroup Operations in Faulty SIMD Hypercubes" Proc. Int'l Parallel Processing Symp., pp. 706711 Apr. 1993.
[24] C.S. Raghavendra and M.A. Sridhar, "Computing with Faulty SIMD Hypercubes," Proc. First Int'l Workshop Parallel Processing, Dec. 1994.
[25] C.S. Raghavendra,P.J. Yang,, and S.B. Tien,“Free dimensions—an effective approach to achieving fault tolerance in hypercubes,” 22nd Ann. Int’l Symp. FaultTolerant Computing, pp. 170177, 1992.
[26] C.S. Raghavendra, M.A. Sridhar, and S. Harikumar, "Prefix Computation on a Faulty Hypercube," Proc. Int'l Conf. Parallel Processing, Apr. 1993.
[27] P. Ramanathan and K.G. Shin, "Reliable Broadcast in Hypercube Multicomputers," IEEE Trans. Computers, vol. 37, no. 12, pp. 1,6541,657, Dec. 1988.
[28] S. Ranka and S. Sahni, Hypercube Algorithms for Image Processing and Pattern Recognition.New York: Springer Verlag, 1990.
[29] Y. Saad and M. Schultz, "Topological Properties of Hypercubes," IEEE Trans. Computers, vol. 37, no. 7, pp. 867872, July 1988.
[30] A. Sengupta and C.S. Raghavendra, "Total Exchange in Faulty SIMD Hypercubes," Proc. Int'l Parallel Processing Symp., Apr. 1994.
[31] A. Sengupta and C.S. Raghavendra, "On Some Global Operations in Faulty SIMD Hypercubes," Proc. Int'l Parallel Processing Symp., Apr. 1996.