{"title":"分布式计算第71专栏:人口协议的最新算法进展","authors":"J. Welch","doi":"10.1145/3289137.3289149","DOIUrl":null,"url":null,"abstract":"Population protocols have been an active area of distributed computing for over a decade, as they are an abstract model of numerous real-world scenarios from sensor networks to biological computing paradigms. For this column, Dan Alistarh and Rati Gelashvili provide a timely overview of recent results on population protocols, focusing especially on the case when each agent in the system can have more than a constant amount of local memory. Several key building blocks are presented, followed by applications of these primitives, in an accessible way that conveys the excitement of fast-moving developments in the area.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":"88 1","pages":"62"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Distributed Computing Column 71: Recent Algorithmic Advances in Population Protocols\",\"authors\":\"J. Welch\",\"doi\":\"10.1145/3289137.3289149\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Population protocols have been an active area of distributed computing for over a decade, as they are an abstract model of numerous real-world scenarios from sensor networks to biological computing paradigms. For this column, Dan Alistarh and Rati Gelashvili provide a timely overview of recent results on population protocols, focusing especially on the case when each agent in the system can have more than a constant amount of local memory. Several key building blocks are presented, followed by applications of these primitives, in an accessible way that conveys the excitement of fast-moving developments in the area.\",\"PeriodicalId\":22106,\"journal\":{\"name\":\"SIGACT News\",\"volume\":\"88 1\",\"pages\":\"62\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIGACT News\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3289137.3289149\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIGACT News","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3289137.3289149","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Distributed Computing Column 71: Recent Algorithmic Advances in Population Protocols
Population protocols have been an active area of distributed computing for over a decade, as they are an abstract model of numerous real-world scenarios from sensor networks to biological computing paradigms. For this column, Dan Alistarh and Rati Gelashvili provide a timely overview of recent results on population protocols, focusing especially on the case when each agent in the system can have more than a constant amount of local memory. Several key building blocks are presented, followed by applications of these primitives, in an accessible way that conveys the excitement of fast-moving developments in the area.