
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
S.L. Johnsson, C.T. Ho, "Optimum Broadcasting and Personalized Communication in Hypercubes," IEEE Transactions on Computers, vol. 38, no. 9, pp. 12491268, September, 1989.  
BibTex  x  
@article{ 10.1109/12.29465, author = {S.L. Johnsson and C.T. Ho}, title = {Optimum Broadcasting and Personalized Communication in Hypercubes}, journal ={IEEE Transactions on Computers}, volume = {38}, number = {9}, issn = {00189340}, year = {1989}, pages = {12491268}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.29465}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Optimum Broadcasting and Personalized Communication in Hypercubes IS  9 SN  00189340 SP1249 EP1268 EPD  12491268 A1  S.L. Johnsson, A1  C.T. Ho, PY  1989 KW  optimum broadcasting; personalized communication; hypercubes; Boolean ncube configured multiprocessors; onetoall broadcasting; onetoall personalized communication; single node sending unique data; alltoall broadcasting; alltoall personalized communication; communication graphs; spanning trees; routing; scheduling; concurrent communication; complexity analysis; multiprocessor interconnection networks; scheduling. VL  38 JA  IEEE Transactions on Computers ER   
[1] A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms. Menlo Park, CA: AddisonWesley, 1974.
[2] S. N. Bhatt, F. R. K. Chung, F. T. Leighton, and A. L. Rosenberg, "Optimal simulations of tree machines," inProc. 27th IEEE Symp. Foundations Comput. Sci., 1986, pp. 274282.
[3] S. N. Bhatt and I. I. F. Ipsen, "How to embed trees in hypercubes," Tech. Rep. YALEU/CSD/RR443, Dept. Comput. Sci., Yale Univ., Dec. 1985.
[4] S. A. Browning, "The tree machine: A highly concurrent computing environment," Tech. Pep. 1980:TR:3760, Comput. Sci., California Instit. Technol., Jan. 1980.
[5] E. Dekel, D. Nassimi, and S. Sahni, "Parallel matrix and graph algorithms,"SIAM J. Comput., vol. 10, pp. 657673, 1981.
[6] S. R. Deshpande and R. M. Jenevin, "Scaleability of a binary tree on a hypercube," inProc. Int. Conf. Parallel Processing, 1986, pp. 661 668.
[7] M. J. Fischer,Efficiency of Equivalence Algorithms. New York: Plenum, 1972, pp. 153167.
[8] G. C. Fox and W. Furmanski, "Optimal communication algorithms on hypercube," Tech. Rep. CCCP314, California Instit. Technol., July 1986.
[9] G. C. Fox and D. Jefferson, "Concurrent processor load balancing as a statistical physics problem," Tech. Rep. CCCP172, California Instit. Technol., May 1985.
[10] D. Gannon and J. Van Rosendale, "On the impact of communication complexity in the design of parallel numerical algorithms,"IEEE Trans. Comput., vol. C33, pp. 11801194, Dec. 1984.
[11] J. L. Gustafson, S. Hawkinson, and K. Scott, "The architecture of a homogeneous vector supercomputer," inProc. 1986 Int. Conf. Parallel Processing, 1986, pp. 649652.
[12] J. P. Hayes, T. N. Mudge, Q. F. Stout, S. Colley, and J. Palmer, "Architecture of a hypercube supercomputer, inProc. 1986 Int. Conf. Parallel Processing, 1986, 653660.
[13] D. Hillis,The Connection Machine. Cambridge, MA: M.I.T. Press, 1985.
[14] C. T. Ho and S. L. Johnsson, "Distributed routing algorithms for broadcasting and personalized communication in hypercubes," inProc. 1986 Int. Conf. Parallel Processing, 1986, pp. 640648. Tech. Rep. YALEU/DCS/RR483, May 1986.
[15] C. T. Ho and S. L. Johnsson, "Spanning balanced trees in Boolean cubes," Tech. Rep. YALEU/DCS/RR508, Dept. Comput. Sci., Yale Univ., Jan. 1987.
[16] Intel iPSC System Overview, Intel Corp., Jan. 1986.SIAM J. Sci. Stat. Comput., to be published.
[17] S. L. Johnsson, "Communication efficient basic linear algebra computations on hypercube architectures,"J. Parallel Distributed Comput., pp. 133172, 1987.
[18] S. L. Johnsson, "Ensemble architectures and their algorithms: An overview," inProceedings of the IMA Workshop Numerical Algorithms Par. Comput. Architectures, H. Schultz Ed., Berlin, Germany:SpringerVerlag, 1987. YALE/DCS/RR580. Revision of YALE/DCS/RR367, Feb. 1985.
[19] S. L. Johnsson, "Oddeven cyclic reduction on ensemble architectures and the solution tridiagonal systems of equations," Tech. Rep. YALE/DCS/ RR339, Dep. Comput. Sci., Yale Univ., Oct. 1984.
[20] S. L. Johnson, "Solving tridiagonal systems on ensemble architectures,"SIAM J. Sci. Stat. Comput., vol. 8, pp. 345392, 1987.
[21] S. L. Johnsson and C. T. Ho, "Algorithms for multiplying matrices of arbitrary shapes using shared memory primitives on a Boolean cube," Tech. Rep. YALEU/DCS/RR569, Dep. Comput. Sci., Yale Univ., Oct. 1987. Revision of YALE/DCS/RR530. Presented at the ARMY Workshop on Medium Scale Parallel Processors, Stanford Univ., Jan. 1986.
[22] S. L. Johnsson and C. T. Ho, "Algorithms for matrix transposition on BooleanNcube configured ensemble architectures,"SIAM J. Matrix Anal. Applic., vol. 9, pp. 419454, 1988.
[23] S. L. Johnsson and C. T. Ho, "Multiple tridiagonal systems, the alternating direction method, and Boolean cube configured multiprocessors," Tech. Rep. YALEU/ DCS/RR532, Yale Univ., June 1987.SIAM J. Sci. Stat. Comput., to be published.
[24] S. L. Johnsson and C. T. Ho, "Spanning graphs for optimum broadcasting and personalized communication in hypercubes," Tech. Rep. YALEU/DCS/RR500, Dep. Comput. Sci., Yale Univ., Nov. 1986.
[25] F. T. Leighton,Complexity Issues in VLSI: Optimal Layouts for the ShuffleExchange Graph and Lower Bound Techniques for VLSI. Cambridge, MA: M.I.T. Press, 1983.
[26] O. A. McBryan and E. F. Van de Velde, "Hypercube algorithms and implementations,"SIAM J. Scientif. Statist. Comput., vol. 8, no. 2, pp. s227s287, Mar. 1987.
[27] E. M. Reingold, J. Nievergelt, and N. Deo,Combinatorial Algorithms. Englewood Cliffs, NJ: PrenticeHall, 1977.
[28] Y. Saad and M. H. Schultz, "Data communication in hypercubes," Tech. Rep. YALEU/DCS/RR428, Dep. Comput. Sci., Yale Univ., Oct. 1985.
[29] Y. Saad and M. H. Schultz, "Topological properties of hypercubes," Tech. Rep. YALEU/ DCS/RR389, Dep. Comput. Sci., Yale Univ., June 1985.
[30] C. L. Seitz, "The Cosmic Cube,"Commun. ACM, pp. 2233, Jan. 1985.
[31] Q. F. Stout and B. Wager, "Passing messages in linkbound hypercubes," inProc. 1986 Hypercube Conf., SIAM, 1987.
[32] L. G. Valiant and G. Brebner, "Universal schemes for parallel communication," inProc. 13th Annu. ACM Symp. Theory Comput., 1981.
[33] A. Y. Wu, "Embedding of tree networks in hypercubes,"J. Parallel Distrib. Comput., vol. 2, pp. 238249, 1985.
[34] J. Aubert and B. Schneider, "Decomposition de la somme cartesienne d'un cycle et de l'union de deux cycles hamiltoniens en cycles hamiltoniens,"Discrete Math., vol. 38, pp. 716, 1982.
[35] M. Foregger, "Hamiltonian decompositions of products of cycles,"Discrete Math., vol. 24, pp. 251260, 1978.
[36] A. S. Wagner, personal communication, 1988.