
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
S.N. Bhatt, G. Pucci, A. Ranade, A.L. Rosenberg, "Scattering and Gathering Messages in Networks of Processors," IEEE Transactions on Computers, vol. 42, no. 8, pp. 938949, August, 1993.  
BibTex  x  
@article{ 10.1109/12.238484, author = {S.N. Bhatt and G. Pucci and A. Ranade and A.L. Rosenberg}, title = {Scattering and Gathering Messages in Networks of Processors}, journal ={IEEE Transactions on Computers}, volume = {42}, number = {8}, issn = {00189340}, year = {1993}, pages = {938949}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.238484}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Scattering and Gathering Messages in Networks of Processors IS  8 SN  00189340 SP938 EP949 EPD  938949 A1  S.N. Bhatt, A1  G. Pucci, A1  A. Ranade, A1  A.L. Rosenberg, PY  1993 KW  message scattering; messages gathering; networks of processors; trees of processors; noncolliding paths; buffering; queueing mechanisms; spanning trees; distributed processing; multiprocessor interconnection networks; scheduling. VL  42 JA  IEEE Transactions on Computers ER   
The operations of scattering and gathering in a network of processors involve one processor of the network (P/sub 0/) communicating with all other processors. In scattering, P/sub 0/ sends distinct messages to P/sub 0/. The authors consider networks that are trees of processors. Algorithms for scattering messages from and gathering messages to the processor that resides at the root of the tree are presented. The algorithms are quite general, in that the messages transmitted can differ arbitrarily in length; quite strong, in that they send messages along noncolliding paths, and hence do not require any buffering or queueing mechanisms in the processors; and quite efficient in that algorithms for scattering in general trees are optimal, the algorithm for gathering in a path is optimal and the algorithms for gathering in general trees are nearly optimal. The algorithms can easily be converted using spanning trees to efficient algorithms for scattering and gathering in networks of arbitrary topologies.
[1] M. Baumslag and F. S. Annexstein, "A unified approach to global permutation routing on parallel networks,"Math. Syst. Theory, vol. 24, pp. 233251, 1991.
[2] S. N. Bhatt, G. Bilardi, G. Pucci, A. Ranade, A. L. Rosenberg, and E. J. Schwabe, "On bufferless routing of variable length message in leveled networks," in1st European Symp. Algorithms, 1993, to be published.
[3] W.J. Dally and C.L. Seitz, "DeadlockFree Message Routing in Multiprocessor Interconnection Networks,"IEEE Trans. Computers, Vol. C36, No. 5, May 1987, pp. 547553.
[4] P. Fraigniaud, S. Miguet, and Y. Robert, "Complexity of scattering on a ring of processors,"Parallel Computing, vol. 13, pp. 377383, 1990.
[5] D. S. Greenberg, Full utilization of communication resources, Ph.D. dissertation, Yale Univ., New Haven, CT, 1991.
[6] D. S. Greenberg and S. N. Bhatt, "Routing multiple paths in hypercubes,"Math. Syst. Theory, vol. 24, pp. 295321.
[7] J. Hromkovic, C. D. Jeschke, and B. Monien, "Optimal algorithms for dissemination of information in some interconnection networks," inMathematical Foundations of Computer Science '90. Also inLecture Notes in Computer Science 452. New York: SpringerVerlag, 1990.
[8] S. L. Johnsson and C.T. Ho, "Optimal broadcasting and personalized communication in hypercubes,"IEEE Trans. Computers, vol. 38, pp. 12491268.
[9] G. Kortsarz and D. Peleg, "Approximation algorithms for minimum time broadcast,"Theory of Computing and Systems (ISTCS '92). Also inLecture Notes in Computer Science 601, New York: SpringerVerlag, 1992, pp. 6778.
[10] M. Kunde and T. Tensi, "Multipacket routing on meshconnected arrays," in1st ACM Symp. Parallel Algorithms and Architectures, 1989, pp. 336343.
[11] J.J. Li, "Multiscattering on a reconfigurable network of processors," L.I.P., Ecole Normale Supérieure de Lyon, Tech. Rep. 9103, 1991.
[12] D. Nassimi and S. Sahni, "Data broadcasting in SIMD computers,"IEEE Trans. Computers, vol. C30, pp. 101107, 1981.
[13] G. D. Pifarré, L. Gravano, S. A. Felperin, and J. L.C. Sanz, "Fully adaptive minimal deadlockfree packet routing in hypercubes, meshes, and other networks," inProc. 3rd Ann. ACM Symp Parallel Algorithms and Architectures, 1991.
[14] Y. Saad and M. H. Schultz, "Data communication in parallel architectures,"Parallel Computing, vol. 11, pp. 131150, 1989.
[15] Q. Stout and B. Wagar, "Intensive hypercube communication, prearranged communication in linkbound machines,"J. Parallel Distributed Comput., vol. 10, pp. 167181, 1990.
[16] D. M. Topkis, "Alltoall broadcast by flooding in communication networks,"IEEE Trans. Computers, vol. 38, pp. 13301333, 1989.
[17] L. G. Valiant and G. Brebner, "Universal schemes for parallel communication," inProc. 13th Annu. ACM Symp. Theory Comput., 1981.