Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Multi-packet-routing on mesh connected arrays
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
All-to-All Broadcast by Flooding in Communications Networks
IEEE Transactions on Computers
Intensive hypercube communication. Prearranged communication in link-bound machines
Journal of Parallel and Distributed Computing
Optimum algorithms for dissemination of information in some interconnection networks
MFCS '90 Proceedings on Mathematical foundations of computer science 1990
Fully-adaptive minimal deadlock-free packet routing in hypercubes, meshes, and other networks
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Full utilization of communication resources
Full utilization of communication resources
Approximation Algorithms for Minimum Time Broadcast
ISTCS'92 Proceedings of the Israel Symposium on Theory of Computing and Systems
On Bufferless Routing of Variable-length Message in Leveled Networks (Extended Abstract)
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Performance measures and scheduling policies in ring networks
IEEE/ACM Transactions on Networking (TON)
On Bufferless Routing of Variable Length Messages in Leveled Networks
IEEE Transactions on Computers
Performance evaluation of processor allocation algorithms for parallel query execution
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Message Passing for Linux Clusters with Gigabit Ethernet Mesh Connections
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 9 - Volume 10
One-to-all personalized communication in torus networks
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
An approximation algorithm for the wireless gathering problem
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Designing computational steering facilities for distributed agent based simulations
Proceedings of the 2013 ACM SIGSIM conference on Principles of advanced discrete simulation
| Hi-index | 14.98 |
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.