{"title":"基于状态的Paxos","authors":"Nicolo Rivetti, A. Corsaro","doi":"10.1145/2541596.2541600","DOIUrl":null,"url":null,"abstract":"Paxos is an algorithm that provides an elegant and optimal solution to the consensus problem in distributed systems. Despite its conceptual simplicity, industrial strength and high performance implementations of Paxos are very hard. This paper presents and evaluates the performance of State Paxos, a novel variation of the Paxos consensus algorithm that exploits overwrite semantics to eliminate most of the complexities and inefficiencies introduced by state management. This variation is suitable in applications where the current state depends only on the last update as opposed to the entire history, such as group management and distributed key-value stores.","PeriodicalId":236953,"journal":{"name":"Middleware Industry '13","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"State based Paxos\",\"authors\":\"Nicolo Rivetti, A. Corsaro\",\"doi\":\"10.1145/2541596.2541600\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Paxos is an algorithm that provides an elegant and optimal solution to the consensus problem in distributed systems. Despite its conceptual simplicity, industrial strength and high performance implementations of Paxos are very hard. This paper presents and evaluates the performance of State Paxos, a novel variation of the Paxos consensus algorithm that exploits overwrite semantics to eliminate most of the complexities and inefficiencies introduced by state management. This variation is suitable in applications where the current state depends only on the last update as opposed to the entire history, such as group management and distributed key-value stores.\",\"PeriodicalId\":236953,\"journal\":{\"name\":\"Middleware Industry '13\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Middleware Industry '13\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2541596.2541600\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Middleware Industry '13","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2541596.2541600","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Paxos is an algorithm that provides an elegant and optimal solution to the consensus problem in distributed systems. Despite its conceptual simplicity, industrial strength and high performance implementations of Paxos are very hard. This paper presents and evaluates the performance of State Paxos, a novel variation of the Paxos consensus algorithm that exploits overwrite semantics to eliminate most of the complexities and inefficiencies introduced by state management. This variation is suitable in applications where the current state depends only on the last update as opposed to the entire history, such as group management and distributed key-value stores.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
