A message-optimal algorithm for distributed termination detection
β Scribed by S. Chandrasekaran; S. Venkatesan
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 962 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The ability to set breakpoints stands, along with the possibility of deterministic reexecution, as one of the most important issues in the debugging of message-passing programs. We consider in this paper the design of fully distributed algorithms for the detection of breakpoints in such programs, an
We consider multiple message broadcasting in tree networks. The source (considered as the root of the tree) has k messages which have to be broadcast to all nodes of the tree. In every time unit each node can send one of its already obtained messages to one of its children. A k-message broadcasting