NDLI: Fast computation by population protocols with a leader

Please wait, while we are loading the content...

Fast computation by population protocols with a leader

Content Provider	Springer Nature Link
Author	Angluin, Dana Aspnes, James Eisenstat, David
Copyright Year	2008
Abstract	Fast algorithms are presented for performing computations in a probabilistic population model. This is a variant of the standard population protocol model, in which finite-state agents interact in pairs under the control of an adversary scheduler, where all pairs are equally likely to be chosen for each interaction. It is shown that when a unique leader agent is provided in the initial population, the population can simulate a virtual register machine with high probability in which standard arithmetic operations like comparison, addition, subtraction, and multiplication and division by constants can be simulated in O(n log5 n) interactions using a simple register representation or in O(n log2 n) interactions using a more sophisticated representation that requires an extra O(n log O(1) n)-interaction initialization step. The central method is the extensive use of epidemics to propagate information from and to the leader, combined with an epidemic-based phase clock used to detect when these epidemics are likely to be complete. Applications include a reduction of the cost of computing a semilinear predicate to O(n log5 n) interactions from the previously best-known bound of O(n 2 log n) interactions and simulation of a LOGSPACE Turing machine using O(n log2 n) interactions per step after an initial O(n log O(1) n)-interaction startup phase. These bounds on interactions translate into polylogarithmic time per step in a natural parallel model in which each agent participates in an expected Θ(1) interactions per time unit. Open problems are discussed, together with simulation results that suggest the possibility of removing the initial-leader assumption.
Starting Page	183
Ending Page	199
Page Count	17
File Format	PDF
ISSN	01782770
Journal	Distributed Computing
Volume Number	21
Issue Number	3
e-ISSN	14320452
Language	English
Publisher	Springer-Verlag
Publisher Date	2008-07-19
Publisher Place	Berlin/Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Theory of Computation Software Engineering/Programming and Operating Systems Computer Systems Organization and Communication Networks Computer Hardware Computer Communication Networks
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Computer Networks and Communications Computational Theory and Mathematics Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

The computational power of population protocols

On space complexity of self-stabilizing leader election in mediated population protocol

Randomized leader election

A simple population protocol for fast robust approximate majority

Leader election using loneliness detection

Fast and scalable rendezvousing

Threshold protocols in survivor set systems

Fast flooding over Manhattan

Fast message dissemination in random geometric networks

Fast computation by population protocols with a leader

Similar Documents

The computational power of population protocols

On space complexity of self-stabilizing leader election in mediated population protocol

Randomized leader election

A simple population protocol for fast robust approximate majority

Leader election using loneliness detection

Fast and scalable rendezvousing

Threshold protocols in survivor set systems

Fast flooding over Manhattan

Fast message dissemination in random geometric networks

Fast computation by population protocols with a leader