scientific article; zbMATH DE number 4068275
[For the entire collection see Zbl 0638.00039.] Distributed environments are considered where the size of a message is fixed. That is, a message is a packet which can contain at most c bits of data where c is a constant and is called packet size. A general solution algorithm using packets is presented for the well known distributed selection problem, and its packet complexity is analyzed. For specific classes of network topologies, bounds are obtained which either match the one of existing solutions or improve them for a large range of values of the packet size c. The actual bound on the packet complexity of the proposed selection algorithm is shown to depend on the location of the node which synchronizes the algorithm. This leads to the problem of determining, for a given network, a center which minimizes the required amount of communication activities. A solution to this problem is presented for acyclic networks.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3801068)