Maximum Finding on a Multiple Access Broadcast Network

@article{Martel1994MaximumFO,
  title={Maximum Finding on a Multiple Access Broadcast Network},
  author={Charles U. Martel},
  journal={Inf. Process. Lett.},
  year={1994},
  volume={52},
  pages={7-15}
}
We consider protocols for maximum finding on a multiple access network such as an Ethernet. In the maximum finding problem there is a set of nodes C on the network, and each node in C has an associated real value. We want to quickly identify the node of maximum value in C. Maximum finding is a fundamental problem with applications to load-balancing, prioritized transmission protocols, distributed and parallel sorting algorithms, and many other problems. We show that if there are c nodes in the… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 26 extracted citations

K-Selection Protocols from Energetic Complexity Perspective

2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum • 2013
View 12 Excerpts
Highly Influenced

Generalization of Sorting in Single Hop Wireless Networks

IEICE Transactions • 2006
View 18 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Broadcast Communications and Distributed Algorithms

IEEE Transactions on Computers • 1986
View 7 Excerpts
Highly Influenced

Load estimation , problem size reduction and maximum finding in multiple access broadcast networks

T. Vayda
Allerton Conf . • 1987

Vayda, Load estimation, problem size reduction and maximum finding in multiple access broadcast networks

T. C. Martel
in: Proc. 25th Arm. Allerton Conf • 1987

Similar Papers

Loading similar papers…