Trade-Offs for Add Gossiping
نویسنده
چکیده
In the gossiping problem, each node of a network starts with a unique piece of information and must acquire the information of all the other nodes. This is done using two-way communications between pairs of nodes. In this paper, we consider gossiping in n-node networks with n odd, where we use a linear cost model, in which the cost of communication is proportional to the amount of information transmitted. We also assume a synchronous model, in which the pairwise communications are organized into rounds, and all communications in one round start at the same time. Each communication between two vertices during a given round uses a certain number of steps, each step being the time to exchange an indivisible piece of information. Fertin and Peters [3] have given optimal gossip algorithms in the synchronous model for odd n when Rn, the number of rounds, is minimum (Rn log2 n 1) ; that is, they have determined the minimum number of steps Sn that are used in a synchronous gossip algorithm with log2 n 1 rounds. As suggested in [4] and [3], we study in this paper the trade-offs between Rn and Sn for odd n in the linear cost model in the synchronous case. We show several bounds on Sn (resp. on Rn) when the optimality condition on Rn (resp. Sn) is relaxed. We show that some of these bounds are tight for an infinite number of cases, and discuss such results.
منابع مشابه
Time and Cost Trade-Offs in Gossiping
Each of n processors has a value which should be transmitted to all other processors. This fundamental communication task is called gossiping. In a unit of time every processor can communicate with at most one other processor and during such a transmission each member of a communicating pair learns all values currently known to the other. Two important criteria of efficiency of a gossiping algo...
متن کاملEthical Perspective: Five Unacceptable Trade-offs on the Path to Universal Health Coverage
This article discusses what ethicists have called “unacceptable trade-offs” in health policy choices related to universal health coverage (UHC). Since the fiscal space is constrained, trade-offs need to be made. But some trade-offs are unacceptable on the path to universal coverage. Unacceptable choices include, among other examples from low-income countries, to expand coverage for services wit...
متن کاملDefining Pathways and Trade-offs Toward Universal Health Coverage; Comment on “Ethical Perspective: Five Unacceptable Trade-offs on the Path to Universal Health Coverage”
The World Health Organization’s (WHO’s) World Health Report 2010, “Health systems financing, the path to universal coverage,” promoted universal health coverage (UHC) as an aspirational objective for country health systems. Yet, in addition to the dimensions of services and coverage, distribution of coverage in the population, and financial risk protection highlighted by the report, the conside...
متن کاملA one-model approach for Computation of congestion With productions trade-offs and weight restrictions
متن کامل
Universal Health Coverage – The Critical Importance of Global Solidarity and Good Governance; Comment on “Ethical Perspective: Five Unacceptable Trade-offs on the Path to Universal Health Coverage”
This article provides a commentary to Ole Norheim’ s editorial entitled “Ethical perspective: Five unacceptable trade-offs on the path to universal health coverage.” It reinforces its message that an inclusive, participatory process is essential for ethical decision-making and underlines the crucial importance of good governance in setting fair priorities in healthcare. Solidarity on both natio...
متن کامل