Fast computation by population protocols with a leader

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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Distributed computing Ročník 21; číslo 3; s. 183 - 199
Hlavní autori:	Angluin, Dana, Aspnes, James, Eisenstat, David
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer-Verlag 01.09.2008 Springer Nature B.V
Predmet:	Computer Communication Networks Computer Hardware Computer Science Computer Systems Organization and Communication Networks Software Engineering/Programming and Operating Systems Theory of Computation Parallel Time Infected Node Turing Machine Leader Election Phase Clock
ISSN:	0178-2770, 1432-0452
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

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 log 5 n ) interactions using a simple register representation or in O ( n log 2 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 log 5 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 log 2 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.
AbstractList	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. [PUBLICATION 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 log 5 n ) interactions using a simple register representation or in O ( n log 2 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 log 5 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 log 2 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. 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. [PUBLICATION ABSTRACT]
Author	Aspnes, James Angluin, Dana Eisenstat, David
Author_xml	– sequence: 1 givenname: Dana surname: Angluin fullname: Angluin, Dana organization: Department of Computer Science, Yale University – sequence: 2 givenname: James surname: Aspnes fullname: Aspnes, James email: aspnes@cs.yale.edu organization: Department of Computer Science, Yale University – sequence: 3 givenname: David surname: Eisenstat fullname: Eisenstat, David
BookMark	eNp9kEFLwzAUx4NMcFM_gLfixVP1vTRtkqMMp8LAi55D2qba0TU1SZHt05tRQRjoITwCv9_j__4LMuttbwi5QrhFAH7nARgrUgARX8HT_QmZI8toCiynMzIH5CKlnMMZWXi_AYAMkc5JsdI-JJXdDmPQobV9Uu6SwQ5jN_0GZ4OtbOeTrzZ8JDrpjK6NuyCnje68ufyZ5-Rt9fC6fErXL4_Py_t1WmWMh7TGUgpKjYDCZELUmSwpywqNmudaUpnrRooGIS8bgxrKmgOrBEMudV4g8Oyc3Ex7Y47P0figtq2vTNfp3tjRKx5PBMFzGsnrI3JjR9fHcIqiLEBiziLEJ6hy1ntnGlW109nB6bZTCOrQppraVLFNdWhT7aOJR-bg2q12u38dOjk-sv27cb-R_pa-Ae-Qh_I
CitedBy_id	crossref_primary_10_1109_TPDS_2020_2991771 crossref_primary_10_1007_s00446_020_00385_0 crossref_primary_10_1016_j_tcs_2012_10_032 crossref_primary_10_1587_transinf_2019FCP0003 crossref_primary_10_1007_s00446_021_00404_8 crossref_primary_10_1287_ijoc_2018_0845 crossref_primary_10_1007_s11047_018_9723_9 crossref_primary_10_1109_TPDS_2021_3076769 crossref_primary_10_1016_j_ic_2016_12_002 crossref_primary_10_1016_j_tcs_2024_114926 crossref_primary_10_1016_j_tcs_2018_09_005 crossref_primary_10_1007_s00446_020_00378_z crossref_primary_10_1145_3156693 crossref_primary_10_1007_s00446_023_00450_4 crossref_primary_10_1007_s00446_017_0309_z crossref_primary_10_1016_j_tcs_2021_08_038 crossref_primary_10_1007_s00446_015_0255_6 crossref_primary_10_1007_s11047_014_9435_8 crossref_primary_10_1007_s11047_024_09999_w crossref_primary_10_1007_s00236_016_0272_3 crossref_primary_10_1016_j_cosrev_2010_09_001 crossref_primary_10_1016_j_jcss_2023_103481 crossref_primary_10_1007_s00446_025_00481_z crossref_primary_10_1016_j_tcs_2011_02_003 crossref_primary_10_1587_transinf_2018FCP0009 crossref_primary_10_1007_s00446_025_00487_7 crossref_primary_10_1016_j_tcs_2011_07_001 crossref_primary_10_1007_s00446_012_0173_9 crossref_primary_10_1145_3289137_3289150 crossref_primary_10_1007_s11047_013_9393_6 crossref_primary_10_1007_s11047_017_9648_8 crossref_primary_10_1016_j_tcs_2019_09_034 crossref_primary_10_1109_TPDS_2018_2881125 crossref_primary_10_1007_s00446_020_00377_0 crossref_primary_10_1016_j_tcs_2010_09_016 crossref_primary_10_1016_j_ic_2021_104698 crossref_primary_10_1007_s00446_016_0281_z crossref_primary_10_1016_j_jcss_2021_05_001 crossref_primary_10_1145_3590776 crossref_primary_10_1016_j_jpdc_2015_02_005 crossref_primary_10_1007_s00446_017_0317_z crossref_primary_10_1016_j_tcs_2012_08_026 crossref_primary_10_1145_3424659
Cites_doi	10.1007/s00446-005-0138-3 10.1021/jp993732q 10.1007/11795490_30 10.1007/978-3-540-75142-7_5 10.1002/rsa.3240070105 10.1142/S0129626491000161 10.1093/imamat/1.1.42 10.1021/j100540a008 10.1109/71.888644 10.1007/11776178_3 10.1007/BF03160228 10.1007/11776178_4 10.1007/s00446-007-0040-2 10.1007/11502593_8 10.1007/s00446-008-0059-z 10.1145/1011767.1011810 10.1007/11864219_5 10.1007/3-540-45032-7_3 10.1145/312203.312207 10.1145/1146381.1146425 10.1016/0378-4371(92)90283-V 10.1007/11795490_10 10.1145/1017460.1017463
ContentType	Journal Article
Copyright	Springer-Verlag 2008
Copyright_xml	– notice: Springer-Verlag 2008
DBID	AAYXX CITATION 3V. 7RQ 7SC 7XB 8AL 8AO 8FD 8FE 8FG 8FK ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- L7M L~C L~D M0N P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS Q9U U9A
DOI	10.1007/s00446-008-0067-z
DatabaseName	CrossRef ProQuest Central (Corporate) Career & Technical Education Database Computer and Information Systems Abstracts ProQuest Central (purchase pre-March 2016) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials - QC ProQuest Central ProQuest Technology Collection ProQuest One ProQuest Central Korea ProQuest Central Student SciTech Collection (ProQuest) ProQuest Computer Science Collection Computer Science Database (ProQuest) Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China ProQuest Central Basic
DatabaseTitle	CrossRef Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Pharma Collection ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Central Korea ProQuest Central (New) Advanced Technologies Database with Aerospace Career and Technical Education (Alumni Edition) Advanced Technologies & Aerospace Collection ProQuest Computing ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest Career and Technical Education ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni)
DatabaseTitleList	Computer Science Database Computer and Information Systems Abstracts
Database_xml	– sequence: 1 dbid: 7RQ name: Career & Technical Education Database url: https://search.proquest.com/career sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
EISSN	1432-0452
EndPage	199
ExternalDocumentID	1527061511 10_1007_s00446_008_0067_z
GroupedDBID	-4Z -59 -5G -BR -EM -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 1N0 1SB 203 28- 29G 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 78A 7RQ 8AO 8FE 8FG 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYOK AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDBF ABDPE ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACUHS ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADMLS ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN AZQEC B-. B0M BA0 BBWZM BDATZ BENPR BGLVJ BGNMA BPHCQ BSONS CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 DWQXO EAD EAP EBD EBLON EBS EDO EIOEI EJD EMK EPL ESBYG ESX FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K6V K7- KDC KOV KOW LAS LLZTM M0N M4Y MA- N2Q N9A NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P2P P62 P9O PF0 PQQKQ PROAC PT4 PT5 Q2X QOK QOS R4E R89 R9I RHV RIG RNI ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TN5 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR YZZ Z45 Z7X Z83 Z88 Z8R Z8W Z92 ZCA ZMTXR ~8M ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AETEA AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT PQGLB 7SC 7XB 8AL 8FD 8FK JQ2 L7M L~C L~D PKEHL PQEST PQUKI PRINS Q9U U9A PUEGO
ID	FETCH-LOGICAL-c347t-d1b9822e806e388d39b2436a1a75a9295af98f105bfe1a0bd704c84179a561073
IEDL.DBID	RSV
ISICitedReferencesCount	139
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000258243400002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0178-2770
IngestDate	Wed Oct 01 14:12:33 EDT 2025 Tue Dec 02 15:59:02 EST 2025 Sat Nov 29 06:13:25 EST 2025 Tue Nov 18 22:40:10 EST 2025 Fri Feb 21 02:40:07 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	3
Keywords	Parallel Time Infected Node Turing Machine Leader Election Phase Clock
Language	English
License	http://www.springer.com/tdm
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c347t-d1b9822e806e388d39b2436a1a75a9295af98f105bfe1a0bd704c84179a561073
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23
PQID	219609154
PQPubID	31799
PageCount	17
ParticipantIDs	proquest_miscellaneous_743208752 proquest_journals_219609154 crossref_citationtrail_10_1007_s00446_008_0067_z crossref_primary_10_1007_s00446_008_0067_z springer_journals_10_1007_s00446_008_0067_z
PublicationCentury	2000
PublicationDate	20080900 2008-9-00 20080901
PublicationDateYYYYMMDD	2008-09-01
PublicationDate_xml	– month: 9 year: 2008 text: 20080900
PublicationDecade	2000
PublicationPlace	Berlin/Heidelberg
PublicationPlace_xml	– name: Berlin/Heidelberg – name: Heidelberg
PublicationTitle	Distributed computing
PublicationTitleAbbrev	Distrib. Comput
PublicationYear	2008
Publisher	Springer-Verlag Springer Nature B.V
Publisher_xml	– name: Springer-Verlag – name: Springer Nature B.V
References	GibsonM.A.BruckJ.Efficient exact stochastic simulation of chemical systems with many species and many channelsJ. Phys. Chem. A20001041876188010.1021/jp993732q Angluin, D., Aspnes, J., Eisenstat, D.: Fast computation by population protocols with a leader. In: Distributed Computing: 20th International Symposium, DISC 2006: Stockholm, Sweden, September 2006: Proceedings, pp. 61–75 (2006) BaileyN.T.J.The Mathematical Theory of Infectious Diseases19752LondonCharles Griffin & Co.0334.92024 HermanT.Phase clocks for transient fault repairIEEE Trans. Parallel Distrib. Syst.200011101048105710.1109/71.888644 AngluinD.AspnesJ.DiamadiZ.FischerM.J.PeraltaR.Computation in networks of passively mobile finite-state sensorsDistrib. Comput.200618423525310.1007/s00446-005-0138-3 GillespieD.T.A rigorous derivation of the chemical master equationPhys. A199218840442510.1016/0378-4371(92)90283-V Daliot, A., Dolev, D., Parnas, H.: Self-stabilizing pulse synchronization inspired by biological pacemaker networks. In: Huang, S.-T., Herman, T. (eds.) Self-Stabilizing Systems, vol. 2704 of Lecture Notes in Computer Science, pp. 32–48. Springer (2003) Guerraoui, R., Ruppert, E.: Even small birds are unique: Population protocols with identifiers. Technical Report CSE-2007-04, Department of Computer Science and Engineering, York University, (2007) Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: On the power of anonymous one-way communication. In: Ninth International Conference on Principles of Distributed Systems, pp. 307–318, December 2005 Angluin, D., Fischer, M.J., Jiang, H.: Stabilizing consensus in mobile networks. In: Proceedings of the Second IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS ’06), pp. 37–50 (2006) Angluin, D., Aspnes, J., Fischer, M.J., Jiang, H.: Self-stabilizing population protocols. In: Ninth International Conference on Principles of Distributed Systems, pp. 79–90, December 2005 BirmanK.P.HaydenM.OzkasapO.XiaoZ.BudiuM.MinskyY.Bimodal multicastACM Trans. Comput. Syst.1999172418810.1145/312203.312207 DolevS.WelchJ.L.Self-stabilizing clock synchronization in the presence of Byzantine faultsJ. ACM200451578079910.1145/1017460.10174632147706 Angluin, D., Aspnes, J., Chan, M., Fischer, M.J., Jiang, H., Peralta, R.: Stably computable properties of network graphs. In: Prasanna, V.K., Iyengar, S., Spirakis, P., Welsh, M. (eds.) Distributed Computing in Sensor Systems: First IEEE International Conference, DCOSS 2005, Marina del Rey, CA, USA, June/July, 2005, Proceedings, vol. 3560 of Lecture Notes in Computer Science, pp. 63–74. Springer-Verlag, June 2005 DaleyD.J.KendallD.G.Stochastic rumoursJ. Inst. Math. Appl.19651425510.1093/imamat/1.1.42182064 Angluin, D., Aspnes, J., Eisenstat, D.: Stably computable predicates are semilinear. In: Proceedings of the 25th ACM Symposium on Principles of Distributed Computing, pp. 292–299, July (2006) GillespieD.T.Exact stochastic simulation of coupled chemical reactionsJ. Phys. Chem.197781252340236110.1021/j100540a008 AngluinD.AspnesJ.EisenstatD.RuppertE.The computational power of population protocolsDistrib. Comput.200720427930410.1007/s00446-007-0040-2 Diamadi, Z., Fischer, M.J.: A simple game for the study of trust in distributed systems. Wuhan University J. Nat. Sci. 6(1–2): 72–82, March 2001. Also appears as Yale Technical Report TR–1207, January 2001 MinskyM.L.Computation: Finite and Infinite Machines. Prentice-Hall Series in Automatic Computation1967Englewood Cliffs, NJPrentice-Hall, Inc. Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Urn automata. Technical Report YALEU/DCS/TR-1280, Yale University Department of Computer Science, November (2003) Angluin, D., Aspnes, J., Eisenstat, D.: A simple population protocol for fast robust approximate majority. In: Pelc, A. (ed.) Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, vol. 4731 of Lecture Notes in Computer Science, pp. 20–32. Springer (2007) Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Ruppert, E.: When birds die: Making population protocols fault-tolerant. In: Proceedings of the Second IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS ’06), pp. 51–66 (2006) Angluin, D., Aspnes, J., Eisenstat, D.: A simple population protocol for fast robust approximate majority. Distrib. Comput. (2008, submitted) Presburger, M.: Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In: Comptes-Rendus du I Congrès de Mathématiciens des Pays Slaves, pp. 92–101, Warszawa (1929) Arora, A., Dolev, S., Gouda, M.G.: Maintaining digital clocks in step. In: Toueg, S., Spirakis, P.G., Kirousis, L.M. (eds.) Distributed Algorithms, 5th International Workshop, vol. 579 of Lecture Notes in Computer Science, pp. 71–79, Delphi, Greece. Springer-Verlag (1991) Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. In: PODC ’04: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, pp. 290–299. ACM Press (2004) KamathA.P.MotwaniR.PalemK.SpirakisP.Tail bounds for occupancy and the satisfiability threshold conjectureRandom Struct. Algorithms1995759800834.6805110.1002/rsa.32400701051346284 M.L. Minsky (67_CR27) 1967 67_CR11 67_CR13 67_CR12 D. Angluin (67_CR4) 2006; 18 D.T. Gillespie (67_CR23) 1992; 188 67_CR19 67_CR18 D. Angluin (67_CR10) 2007; 20 D.J. Daley (67_CR16) 1965; 1 S. Dolev (67_CR20) 2004; 51 67_CR17 A.P. Kamath (67_CR26) 1995; 7 D.T. Gillespie (67_CR22) 1977; 81 T. Herman (67_CR25) 2000; 11 N.T.J. Bailey (67_CR14) 1975 67_CR24 67_CR5 67_CR6 67_CR7 67_CR8 67_CR9 67_CR28 67_CR1 K.P. Birman (67_CR15) 1999; 17 M.A. Gibson (67_CR21) 2000; 104 67_CR2 67_CR3
References_xml	– reference: KamathA.P.MotwaniR.PalemK.SpirakisP.Tail bounds for occupancy and the satisfiability threshold conjectureRandom Struct. Algorithms1995759800834.6805110.1002/rsa.32400701051346284 – reference: DolevS.WelchJ.L.Self-stabilizing clock synchronization in the presence of Byzantine faultsJ. ACM200451578079910.1145/1017460.10174632147706 – reference: GillespieD.T.A rigorous derivation of the chemical master equationPhys. A199218840442510.1016/0378-4371(92)90283-V – reference: Guerraoui, R., Ruppert, E.: Even small birds are unique: Population protocols with identifiers. Technical Report CSE-2007-04, Department of Computer Science and Engineering, York University, (2007) – reference: DaleyD.J.KendallD.G.Stochastic rumoursJ. Inst. Math. Appl.19651425510.1093/imamat/1.1.42182064 – reference: BaileyN.T.J.The Mathematical Theory of Infectious Diseases19752LondonCharles Griffin & Co.0334.92024 – reference: Angluin, D., Aspnes, J., Eisenstat, D.: A simple population protocol for fast robust approximate majority. In: Pelc, A. (ed.) Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, vol. 4731 of Lecture Notes in Computer Science, pp. 20–32. Springer (2007) – reference: MinskyM.L.Computation: Finite and Infinite Machines. Prentice-Hall Series in Automatic Computation1967Englewood Cliffs, NJPrentice-Hall, Inc. – reference: Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Ruppert, E.: When birds die: Making population protocols fault-tolerant. In: Proceedings of the Second IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS ’06), pp. 51–66 (2006) – reference: Presburger, M.: Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In: Comptes-Rendus du I Congrès de Mathématiciens des Pays Slaves, pp. 92–101, Warszawa (1929) – reference: Angluin, D., Aspnes, J., Eisenstat, D.: Stably computable predicates are semilinear. In: Proceedings of the 25th ACM Symposium on Principles of Distributed Computing, pp. 292–299, July (2006) – reference: Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. In: PODC ’04: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, pp. 290–299. ACM Press (2004) – reference: AngluinD.AspnesJ.DiamadiZ.FischerM.J.PeraltaR.Computation in networks of passively mobile finite-state sensorsDistrib. Comput.200618423525310.1007/s00446-005-0138-3 – reference: AngluinD.AspnesJ.EisenstatD.RuppertE.The computational power of population protocolsDistrib. Comput.200720427930410.1007/s00446-007-0040-2 – reference: Angluin, D., Aspnes, J., Fischer, M.J., Jiang, H.: Self-stabilizing population protocols. In: Ninth International Conference on Principles of Distributed Systems, pp. 79–90, December 2005 – reference: Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Urn automata. Technical Report YALEU/DCS/TR-1280, Yale University Department of Computer Science, November (2003) – reference: Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: On the power of anonymous one-way communication. In: Ninth International Conference on Principles of Distributed Systems, pp. 307–318, December 2005 – reference: Angluin, D., Fischer, M.J., Jiang, H.: Stabilizing consensus in mobile networks. In: Proceedings of the Second IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS ’06), pp. 37–50 (2006) – reference: Angluin, D., Aspnes, J., Eisenstat, D.: Fast computation by population protocols with a leader. In: Distributed Computing: 20th International Symposium, DISC 2006: Stockholm, Sweden, September 2006: Proceedings, pp. 61–75 (2006) – reference: BirmanK.P.HaydenM.OzkasapO.XiaoZ.BudiuM.MinskyY.Bimodal multicastACM Trans. Comput. Syst.1999172418810.1145/312203.312207 – reference: Diamadi, Z., Fischer, M.J.: A simple game for the study of trust in distributed systems. Wuhan University J. Nat. Sci. 6(1–2): 72–82, March 2001. Also appears as Yale Technical Report TR–1207, January 2001 – reference: Arora, A., Dolev, S., Gouda, M.G.: Maintaining digital clocks in step. In: Toueg, S., Spirakis, P.G., Kirousis, L.M. (eds.) Distributed Algorithms, 5th International Workshop, vol. 579 of Lecture Notes in Computer Science, pp. 71–79, Delphi, Greece. Springer-Verlag (1991) – reference: GibsonM.A.BruckJ.Efficient exact stochastic simulation of chemical systems with many species and many channelsJ. Phys. Chem. A20001041876188010.1021/jp993732q – reference: Angluin, D., Aspnes, J., Chan, M., Fischer, M.J., Jiang, H., Peralta, R.: Stably computable properties of network graphs. In: Prasanna, V.K., Iyengar, S., Spirakis, P., Welsh, M. (eds.) Distributed Computing in Sensor Systems: First IEEE International Conference, DCOSS 2005, Marina del Rey, CA, USA, June/July, 2005, Proceedings, vol. 3560 of Lecture Notes in Computer Science, pp. 63–74. Springer-Verlag, June 2005 – reference: Angluin, D., Aspnes, J., Eisenstat, D.: A simple population protocol for fast robust approximate majority. Distrib. Comput. (2008, submitted) – reference: Daliot, A., Dolev, D., Parnas, H.: Self-stabilizing pulse synchronization inspired by biological pacemaker networks. In: Huang, S.-T., Herman, T. (eds.) Self-Stabilizing Systems, vol. 2704 of Lecture Notes in Computer Science, pp. 32–48. Springer (2003) – reference: GillespieD.T.Exact stochastic simulation of coupled chemical reactionsJ. Phys. Chem.197781252340236110.1021/j100540a008 – reference: HermanT.Phase clocks for transient fault repairIEEE Trans. Parallel Distrib. Syst.200011101048105710.1109/71.888644 – ident: 67_CR2 – volume: 18 start-page: 235 issue: 4 year: 2006 ident: 67_CR4 publication-title: Distrib. Comput. doi: 10.1007/s00446-005-0138-3 – volume: 104 start-page: 1876 year: 2000 ident: 67_CR21 publication-title: J. Phys. Chem. A doi: 10.1021/jp993732q – ident: 67_CR9 doi: 10.1007/11795490_30 – volume-title: Computation: Finite and Infinite Machines. Prentice-Hall Series in Automatic Computation year: 1967 ident: 67_CR27 – ident: 67_CR7 doi: 10.1007/978-3-540-75142-7_5 – volume: 7 start-page: 59 year: 1995 ident: 67_CR26 publication-title: Random Struct. Algorithms doi: 10.1002/rsa.3240070105 – ident: 67_CR24 – ident: 67_CR13 doi: 10.1142/S0129626491000161 – volume: 1 start-page: 42 year: 1965 ident: 67_CR16 publication-title: J. Inst. Math. Appl. doi: 10.1093/imamat/1.1.42 – volume: 81 start-page: 2340 issue: 25 year: 1977 ident: 67_CR22 publication-title: J. Phys. Chem. doi: 10.1021/j100540a008 – volume: 11 start-page: 1048 issue: 10 year: 2000 ident: 67_CR25 publication-title: IEEE Trans. Parallel Distrib. Syst. doi: 10.1109/71.888644 – ident: 67_CR12 doi: 10.1007/11776178_3 – ident: 67_CR19 doi: 10.1007/BF03160228 – ident: 67_CR28 – ident: 67_CR18 doi: 10.1007/11776178_4 – volume: 20 start-page: 279 issue: 4 year: 2007 ident: 67_CR10 publication-title: Distrib. Comput. doi: 10.1007/s00446-007-0040-2 – ident: 67_CR1 doi: 10.1007/11502593_8 – ident: 67_CR8 doi: 10.1007/s00446-008-0059-z – ident: 67_CR3 doi: 10.1145/1011767.1011810 – ident: 67_CR5 doi: 10.1007/11864219_5 – ident: 67_CR17 doi: 10.1007/3-540-45032-7_3 – volume: 17 start-page: 41 issue: 2 year: 1999 ident: 67_CR15 publication-title: ACM Trans. Comput. Syst. doi: 10.1145/312203.312207 – ident: 67_CR6 doi: 10.1145/1146381.1146425 – volume-title: The Mathematical Theory of Infectious Diseases year: 1975 ident: 67_CR14 – volume: 188 start-page: 404 year: 1992 ident: 67_CR23 publication-title: Phys. A doi: 10.1016/0378-4371(92)90283-V – ident: 67_CR11 doi: 10.1007/11795490_10 – volume: 51 start-page: 780 issue: 5 year: 2004 ident: 67_CR20 publication-title: J. ACM doi: 10.1145/1017460.1017463
SSID	ssj0003112
Score	2.2812507
Snippet	Fast algorithms are presented for performing computations in a probabilistic population model. This is a variant of the standard population protocol model, in...
SourceID	proquest crossref springer
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	183
SubjectTerms	Computer Communication Networks Computer Hardware Computer Science Computer Systems Organization and Communication Networks Software Engineering/Programming and Operating Systems Theory of Computation
SummonAdditionalLinks	– databaseName: Career & Technical Education Database dbid: 7RQ link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NS8MwFH_o9ODF-YlzKjl4UoL9SJv0JCIOT0NFYbeSpCkIo53rJri_3pes7VBwF69tk5S8z-Q9fj-AS4wYeJQVHpp4bijjKqISM2eaxNpEQjKpdebIJvhwKEaj5KnuzanqtsrGJzpHnZXa3pHfoGXFGNsidjv5oJY0yhZXawaNTdjCOB1bNecvz60jDn1X7LQE9DTgvC1qeksMUYZHaVv7R39NFz_D0irX_FUedVFn0P3n_-7Bbp1ukrulfuzDhikOoNtQOZDasg8hHshqRrR77mRF1BeZtORexMI5lKgzFbEXt0SSsWuBPoK3wcPr_SOtKRWoDhmf0cxXFrDPCC82oRBZmKiAhbH0JY8kZkqRzBORY86lcuNLT2XcY1pYljJpEy0eHkOnKAtzAiRXMc5mWBTiGVNFSnKRqdjXiW9vSJjqgdfsaKprvHFLezFOW6RkJ4TU8WCiENJFD67aIZMl2Ma6j_vNxqe13VVpu-s9IO1bNBhbBZGFKedViilTYGH8gx5cN8JdTfDncqdrl-vDTtNI4vln0JlN5-YctvXn7L2aXji1_AY1qebd priority: 102 providerName: ProQuest
Title	Fast computation by population protocols with a leader
URI	https://link.springer.com/article/10.1007/s00446-008-0067-z https://www.proquest.com/docview/219609154 https://www.proquest.com/docview/743208752
Volume	21
WOSCitedRecordID	wos000258243400002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1432-0452 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0003112 issn: 0178-2770 databaseCode: P5Z dateStart: 20040101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Career & Technical Education Database customDbUrl: eissn: 1432-0452 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0003112 issn: 0178-2770 databaseCode: 7RQ dateStart: 20040101 isFulltext: true titleUrlDefault: https://search.proquest.com/career providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database (ProQuest) customDbUrl: eissn: 1432-0452 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0003112 issn: 0178-2770 databaseCode: K7- dateStart: 20040101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1432-0452 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0003112 issn: 0178-2770 databaseCode: BENPR dateStart: 20040101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1432-0452 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0003112 issn: 0178-2770 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8QwEB7U9eDFt7g-lhw8KYG-0qRHlV0EYVnXB-KlJGkKgnTFdgX31zuJbRdFBb0U2qZJSTKTL5nk-wCOcMTAqazw0MRzQyOuGJWInGkSa8OEjKTWmROb4MOhuL9PRvU57rLZ7d6EJJ2nbg-7udgjdeF6dLF0tggdZslm7BT9-q51v6HvQpxWdp4GnLehzO-y-DwYzRHml6CoG2sGa__6y3VYraElOf3oCxuwYIpNWGtkG0htxVsQD2RZEe2eu3Yh6o08t0JexFI3TLB_lMQu0hJJntx25224HfRvzi9oLZ9AdRjxima-suR8RnixCYXIwkQFURhLX3ImERUxmSciR3ylcuNLT2Xci7SwimTSgioe7sBSMSnMLpBcxZibiViI80nFlOQiU7GvE9-uhkSqC15Tj6muucWtxMVT2rIiu3pJneYl1ks668Jx-8nzB7HGb4n3m8ZJaxsrU_S1MaIdFnWBtG_ROGzEQxZmMi1ThEeBpewPunDSNNc8gx-L2_tT6n1YaTaReP4BLFUvU3MIy_q1eixferDIx1c96Jz1h6Mx3l1yitcRe-i5bvsOhonh_w
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8QwEB50FfTiW1yfOehFCfaRNulBxNeiqIuIgreapCkIsrvaVdH_5H90km0rCnrz4LWPtHRe32Sm8wGsY8TAVFZ4aOK5oYyriEpEzjSJtYmEZFLrzJFN8HZb3NwkF0PwXv0LY9sqK5_oHHXW1XaPfBstK8bYFrHd3gO1pFG2uFoxaAy04tS8vmDGVuycHKJ4N4KgdXR1cExLUgGqQ8b7NPOVHVlnhBebUIgsTFTAwlj6kkcSsUIk80TkiDpUbnzpqYx7TAvL0yUt1OAhrjsMIyxkcdSAkf2j9sVl7fpD35VXLeU9DTivy6jeYGopw-TddhtghKBvXwPhJ7r9VpB1ca41-c--0BRMlICa7A0sYBqGTGcGJiuyClL6rlmIW7LoE-2OO20k6pX0avoyYgdWdNEqCmK3pokk967Jew6u_-Tt56HR6XbMApBcxbiaYVGIWbSKlOQiU7GvE9_uATHVBK-SYKrLieqW2OM-rWdBO6GnjukThZ6-NWGzvqU3GCfy28VLlaDT0rMUaS3lJpD6LLoEW-eRHdN9KlIEhYElKgiasFUp0-cCPz5u8dfHrcHY8dX5WXp20j5dgvGqbcbzl6HRf3wyKzCqn_t3xeNqaRQEbv9ayz4AaqhCmg
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8NAEB60FfFifWJ97kEvSjCPTXZzEPFVLJVSRMFb3N1sQJC2mqroP_PfObtNIgp68-A1j03IfPPamcwHsI0eA1NZ7qKKZ9qhTIaOwMjZiSOlQy6oUCq1ZBOs2-U3N3FvAt7Lf2FMW2VpE62hTgfK7JHvo2ZF6NtCup8VXRG909bh8MExBFKm0FqyaYwR0tGvL5i95QftUxT1ju-3zq5Ozp2CYMBRAWUjJ_WkGV-nuRvpgPM0iKVPg0h4goUC44ZQZDHPMAKRmfaEK1PmUsUNZ5cwYQcLcN1JqLMAc54a1I_Pur3Lyg0Eni21IuIRioxVJVV3PMGUYiJvOg_QWzhvX53iZ6T7rThrfV6r8Y-_1hzMFoE2ORprxjxM6P4CNEoSC1LYtEWIWiIfEWWPW5QS-UqGFa0ZMYMsBqgtOTFb1kSQe9v8vQTXf_L2y1DrD_p6BUgmI1xN0zDA7FqGUjCeyshTsWf2hqhsgltKM1HFpHVD-HGfVDOiLQASywCKAEjemrBb3TIcjxn57eK1UuhJYXHypJJ4E0h1Fk2Fqf-Ivh485QkGi74hMPCbsFcC63OBHx-3-uvjtmAaoZVctLudNZgpu2lcbx1qo8cnvQFT6nl0lz9uFvpB4PavQfYBdPFLXQ
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Fast+computation+by+population+protocols+with+a+leader&rft.jtitle=Distributed+computing&rft.au=Angluin%2C+Dana&rft.au=Aspnes%2C+James&rft.au=Eisenstat%2C+David&rft.date=2008-09-01&rft.pub=Springer-Verlag&rft.issn=0178-2770&rft.eissn=1432-0452&rft.volume=21&rft.issue=3&rft.spage=183&rft.epage=199&rft_id=info:doi/10.1007%2Fs00446-008-0067-z&rft.externalDocID=10_1007_s00446_008_0067_z
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0178-2770&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0178-2770&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0178-2770&client=summon