
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Amotz BarNoy, Jehoshua Bruck, ChingTien Ho, Shlomo Kipnis, Baruch Schieber, "Computing Global Combine Operations in the Multiport Postal Model," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 8, pp. 896900, August, 1995.  
BibTex  x  
@article{ 10.1109/71.406965, author = {Amotz BarNoy and Jehoshua Bruck and ChingTien Ho and Shlomo Kipnis and Baruch Schieber}, title = {Computing Global Combine Operations in the Multiport Postal Model}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {6}, number = {8}, issn = {10459219}, year = {1995}, pages = {896900}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.406965}, 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  Computing Global Combine Operations in the Multiport Postal Model IS  8 SN  10459219 SP896 EP900 EPD  896900 A1  Amotz BarNoy, A1  Jehoshua Bruck, A1  ChingTien Ho, A1  Shlomo Kipnis, A1  Baruch Schieber, PY  1995 KW  Census computation KW  distributed systems KW  global combine KW  gossiping KW  messagepassing systems KW  multiple ports KW  parallel computers KW  postal model. VL  6 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] A. Bagchi,E. f. Schmeichel,, and S.L. Hakimi,“Sequential information dissemination by packets,” Networks, vol. 22, no. 4, pp. 317333, July 1992.
[2] V. Bala,J. Bruck,R. Bryant,R. Cypher,P. deJong,P. Elustondo,D. Frye,A. Ho,C.T. Ho,G. Irwin,S. Kipnis,R. Lawrence,, and M. Snir,“The IBM external user interface for scalable parallel systems,” Parallel Computing, vol. 20, no. 4, pp. 445462, Apr. 1994.
[3] V. Bala,J. Bruck,R. Cypher,P. Elustondo,A. Ho,C.T. Ho,S. Kipnis,, and M. Snir,“CCL: A portable and tunable collective communication library forscalable parallel computers,” Eighth Int’l Parallel Processing Symp., IEEE, pp. 835844, Apr. 1994.
[4] M. Barnett,R. Littlefield,D.G. Payne,, and R. van de Geijn,“Global combine on mesh architectures with wormhole routing,” Seventh Int’l Parallel Processing Symp., IEEE, Apr. 1993.
[5] A. BarNoy and S. Kipnis,“Designing broadcasting algorithms in the postal model formessagepassing systems,” Math. Systems Theory, vol. 27, no. 5, pp. 431452, 1994.
[6] A. BarNoy and S. Kipnis,“Multiple message broadcasting in the postal model, Proc. Seventh Int’l Parallel Processing Symp., IEEE, Apr. 1993.
[7] A. BarNoy and S. Kipnis,“Broadcasting multiple messages in simultaneous send/receivesystems, Fifth Symp. Parallel and Distributed, Processing, IEEE, pp. 344347, Dec. 1993.
[8] A. BarNoy,S. Kipnis,, and B. Schieber,“An optimal algorithm for computing census functions inmessagepassing systems,” Parallel Processing Letters, vol. 3, no. 1, pp. 1923, Mar. 1993.
[9] A. BarNoy,S. Kipnis,, and B. Schieber,“Optimal computation of census functions in the postal model,” to appear in Discrete Applied Math.
[10] J. Bruck,L. de Coster,N. Dewulf,C.T. Ho,, and R. Lauwereins,“On the design and implementation of broadcast and global combineoperations using the postal model,” Sixth Symp. Parallel and Distributed Processing, IEEE, pp. 594602, Oct. 1994.
[11] J. Bruck,R. Cypher,, and C.T. Ho,“Multiple message broadcasting with generalized Fibonacci trees,” Fourth Symp. Parallel and Distributed Processing, IEEE, pp. 424431, Dec. 1992.
[12] J. Bruck,C.T. Ho,S. Kipnis,, and D. Weathersby,“Efficient algorithms for alltoall communications in multiportmessagepassing systems,” Sixth Ann. Symp. Parallel Algorithms and Architectures, ACM, pp. 298309, June 1994.
[13] J. Bruck,C.T. Ho,“Efficient global combine operations in multiport messagepassingsystems,” Parallel Proc. Letters, vol. 3, no. 4, pp. 335346, Dec. 1993.
[14] I. Cidon and I. Gopal,“PARIS: An approach to integrated highspeed private networks,” Int’l J. Digital and Analog Cabled Systems, vol. 1, no. 2, pp. 7785, Apr.June 1988.
[15] D. Clark,B. Davie,D. Farber,I. Gopal,B. Kadaba,D. Sincoskie,J. Smith,, and D. Tennenhouse,“The AURORA gigabit testbed,” Computer Networks and ISDN, 1991.
[16] D. Culler,A.C. Dusseau,R.P. Martin,, and K.E. Schauser,“Fast parallel sorting under LogP: From theory to practice,” Workshop on Portability and Performance for Parallel Processing,Southampton, England, 1993.
[17] D. Culler,R. Karp,D. Patterson,A. Sahay,K.E. Schauser,E. Santos,R. Subramonian,, and T. von Eicken,“LogP: Towards a realistic model of parallel computation,” Fourth Symp. Principles and Practices Parallel Programming, SIGPLAN’93, ACM, May 1993.
[18] J. Dongarra et al.,“Document for a standard messagepassing interface,” Message Passing Interface Forum, Univ. of Tennessee, Tech. Report CS93214, Nov. 1993.
[19] Express 3.0 Introductory Guide. Parasoft Corporation, 1990.
[20] G. Fox,M. Johnson,G. Lyzenga,S. Otto,J. Salmon,, and D. Walker,Solving Problems on Concurrent Processors, Vol. I: General Techniques andRegular Problems.Englewood Cliffs, N.J.: Prentice Hall 1988.
[21] S.M. Hedetniemi,S.T. Hedetniemi,, and A.L. Liestman,“A survey of gossiping and broadcasting in communication networks,” Networks, vol. 18, no. 4, pp. 319349, 1988.
[22] 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.
[23] R. Karp,A. Sahay,E. Santos,, and K.E. Schauser,“Optimal broadcast and summation in the LogP model,” Proc. Fifth Ann. Symp. Parallel Algorithms and Architectures, ACM, June 1993.
[24] C.E. Leiserson,Z.S. Abuhamdeh,D.C. Douglas,C.R. Feynman,M.N. Ganmuki,J.V. Hill,W.D. Hillis,B.C. Kuszmaul,M.A. St. Pierre,D.S. Wells,M.C. Wong,S.W. Yang,, and R. Zak,“The network architecture of the connection machine CM5,” Proc. Fourth Ann. Symp. Parallel Algorithms and Architectures, ACM, pp. 272285, June 1992.
[25] J.F. Palmer,“The NCUBE family of parallel supercomputers,” Int’l Conf. Computer Design, IEEE, 1986.
[26] Q.F. Stout and B. Wagar,“Intensive hypercube communication: Prearranged communication inlinkbound machines,” J. Parallel and Distributed Computing, vol. 10, pp. 167181, 1990.
[27] R.A. van de Geijn,“Efficient global combine operations,” Sixth Distributed Memory Computing Conf., IEEE, Apr. 1991.
[28] C.B. Stunkel,D.G. Shea,B. Abali,M.M. Denneau,P.H. Hochschild,D.J. Joseph,B.J. Nathanson,M. Tsao,, and P.R. Varker,“Architectures and implementation of vulcan,” Eighth Int’l Parallel Processing Symp., IEEE, pp. 268274, Apr. 1994.