How Many Cooks Spoil the Soup ?

Michail, O ORCID: 0000-0002-6234-3960 and Spirakis, PG ORCID: 0000-0001-5396-3749 (2016) How Many Cooks Spoil the Soup ? In: 23rd International Colloquium on Structural Information and Communication Complexity, 2016-7-19 - 2016-7-21, Helsinki , Finland.

This is the latest version of this item.

	Text SIROCCO_2016_paper_1.pdf - Author Accepted Manuscript Download (543kB)
	Text MS16.pdf - Submitted version Download (357kB)

Official URL: http://dx.doi.org/10.1007/978-3-319-48314-6_1

Abstract

In this work, we study the following basic question: "How much parallelism does a distributed task permit?" Our definition of parallelism (or symmetry) here is not in terms of speed, but in terms of identical roles that processes have at the same time in the execution. We initiate this study in population protocols, a very simple model that not only allows for a straightforward definition of what a role is, but also encloses the challenge of isolating the properties that are due to the protocol from those that are due to the adversary scheduler, who controls the interactions between the processes. We (i) give a partial characterization of the set of predicates on input assignments that can be stably computed with maximum symmetry, i.e., $\Theta(N_{min})$, where $N_{min}$ is the minimum multiplicity of a state in the initial configuration, and (ii) we turn our attention to the remaining predicates and prove a strong impossibility result for the parity predicate: the inherent symmetry of any protocol that stably computes it is upper bounded by a constant that depends on the size of the protocol.

Item Type:	Conference or Workshop Item (Unspecified)
Additional Information:	19 pages
Uncontrolled Keywords:	cs.DC, cs.DC
Depositing User:	Symplectic Admin
Date Deposited:	12 Oct 2016 09:48
Last Modified:	19 Jan 2023 07:29
DOI:	10.1007/978-3-319-48314-6_1
Related URLs:	Author Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3003736