{"title":"有界和最小全局快照","authors":"B. Groselj","doi":"10.1109/88.260297","DOIUrl":null,"url":null,"abstract":"A distributed protocol that records bounded snapshots of FIFO and non-FIFO communication channels, thus avoiding the unbounded storage requirements of other global-snapshot protocols, is described. The assumptions and definitions underlying the protocol are discussed, and its correctness is demonstrated. A modified protocol that can minimize a recorded global state by solving the maximum-flow problem is also presented.<<ETX>>","PeriodicalId":325213,"journal":{"name":"IEEE Parallel & Distributed Technology: Systems & Applications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Bounded and minimum global snapshots\",\"authors\":\"B. Groselj\",\"doi\":\"10.1109/88.260297\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A distributed protocol that records bounded snapshots of FIFO and non-FIFO communication channels, thus avoiding the unbounded storage requirements of other global-snapshot protocols, is described. The assumptions and definitions underlying the protocol are discussed, and its correctness is demonstrated. A modified protocol that can minimize a recorded global state by solving the maximum-flow problem is also presented.<<ETX>>\",\"PeriodicalId\":325213,\"journal\":{\"name\":\"IEEE Parallel & Distributed Technology: Systems & Applications\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Parallel & Distributed Technology: Systems & Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/88.260297\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Parallel & Distributed Technology: Systems & Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/88.260297","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A distributed protocol that records bounded snapshots of FIFO and non-FIFO communication channels, thus avoiding the unbounded storage requirements of other global-snapshot protocols, is described. The assumptions and definitions underlying the protocol are discussed, and its correctness is demonstrated. A modified protocol that can minimize a recorded global state by solving the maximum-flow problem is also presented.<>