Work-optimal asynchronous algorithms for shared memory parallel computers
SIAM Journal on Computing
PCODE: efficient parallel computing over distributed environments
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Introduction to distributed algorithms
Introduction to distributed algorithms
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
Broadcast Protocols for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
On Distributed Algorithms in a Broadcast Domain
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Scheduling multithreaded computations by work stealing
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Enabling PVM to exploit the SCTP protocol
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Parallel computing on networks of workstations (NOWs) allows effective use of existing hardware and software. NOWs are often connected using a broadcast medium such as an Ethernet, so it is natural to use broadcast as a communication primitive. However, existing parallel programs usually rely on point-to-point protocols for performing broadcasts since native broadcast schemes (UDP broadcast) do not guarantee delivery. Thus the potential of the broadcast medium is lost. Instead of making the broadcast reliable, we design algorithms which use an Unreliable Broadcast. Our algorithms are correct regardless of the reliability of the broadcast, but are more efficient the higher the reliability. We provide experimental results which show that UDP broadcasts are quite reliable in practice and can be used to design efficient Minimum Spanning Tree and Load Balancing algorithms for NOWs.