{"title":"分布式计算","authors":"Dan Alistarh","doi":"10.1145/3457588.3457599","DOIUrl":null,"url":null,"abstract":"Overview. In this edition of the column, we have an exciting contribution from Shir Cohen, Idit Keidar, and Oded Naor (Technion), who provide an in-depth perspective on communication-efficient Byzantine Agreement. With the huge popularity of blockchains, the classic area of Byzantine Agreement has seen a surge of interest, and, given the large-scale and widely-distributed deployments of such mechanisms, communication efficiency is a chief concern. This column provides a gentle introduction to the area, by rst the early work in the 80s. This provides the necessary context for the recent exciting work on communication reduction, from the King & Saia algorithm to Algorand. One very useful feature in this column's contribution is the fact that it provides a uni ed view of these results, along with the mathematical background to understand and di erentiate the underlying results. Many thanks to Shir, Idit and Oded for their contribution!","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Distributed Computing Column 81\",\"authors\":\"Dan Alistarh\",\"doi\":\"10.1145/3457588.3457599\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Overview. In this edition of the column, we have an exciting contribution from Shir Cohen, Idit Keidar, and Oded Naor (Technion), who provide an in-depth perspective on communication-efficient Byzantine Agreement. With the huge popularity of blockchains, the classic area of Byzantine Agreement has seen a surge of interest, and, given the large-scale and widely-distributed deployments of such mechanisms, communication efficiency is a chief concern. This column provides a gentle introduction to the area, by rst the early work in the 80s. This provides the necessary context for the recent exciting work on communication reduction, from the King & Saia algorithm to Algorand. One very useful feature in this column's contribution is the fact that it provides a uni ed view of these results, along with the mathematical background to understand and di erentiate the underlying results. Many thanks to Shir, Idit and Oded for their contribution!\",\"PeriodicalId\":387985,\"journal\":{\"name\":\"ACM SIGACT News\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-03-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM SIGACT News\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3457588.3457599\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM SIGACT News","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3457588.3457599","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Overview. In this edition of the column, we have an exciting contribution from Shir Cohen, Idit Keidar, and Oded Naor (Technion), who provide an in-depth perspective on communication-efficient Byzantine Agreement. With the huge popularity of blockchains, the classic area of Byzantine Agreement has seen a surge of interest, and, given the large-scale and widely-distributed deployments of such mechanisms, communication efficiency is a chief concern. This column provides a gentle introduction to the area, by rst the early work in the 80s. This provides the necessary context for the recent exciting work on communication reduction, from the King & Saia algorithm to Algorand. One very useful feature in this column's contribution is the fact that it provides a uni ed view of these results, along with the mathematical background to understand and di erentiate the underlying results. Many thanks to Shir, Idit and Oded for their contribution!