{"title":"使用因果关系和矢量时间的终止检测","authors":"S. Peterson, P. Kearns","doi":"10.1109/SECON.1996.510151","DOIUrl":null,"url":null,"abstract":"A problem unique to distributed systems is the need to determine that a computation is terminated. We use vector clocks as a basis for a termination detection protocol in which each process is only contacted once following termination. In addition we also present a definition of termination that does not depend on global state. This definition is based on the causal relationships between events and is stated in terms of Lamport's \"happens before\" relation. Because the protocol is also specified in causal terms, this definition can be easily used to formally argue the correctness of the algorithm.","PeriodicalId":338029,"journal":{"name":"Proceedings of SOUTHEASTCON '96","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Termination detection using causality and vector time\",\"authors\":\"S. Peterson, P. Kearns\",\"doi\":\"10.1109/SECON.1996.510151\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A problem unique to distributed systems is the need to determine that a computation is terminated. We use vector clocks as a basis for a termination detection protocol in which each process is only contacted once following termination. In addition we also present a definition of termination that does not depend on global state. This definition is based on the causal relationships between events and is stated in terms of Lamport's \\\"happens before\\\" relation. Because the protocol is also specified in causal terms, this definition can be easily used to formally argue the correctness of the algorithm.\",\"PeriodicalId\":338029,\"journal\":{\"name\":\"Proceedings of SOUTHEASTCON '96\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-04-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of SOUTHEASTCON '96\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SECON.1996.510151\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of SOUTHEASTCON '96","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SECON.1996.510151","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Termination detection using causality and vector time
A problem unique to distributed systems is the need to determine that a computation is terminated. We use vector clocks as a basis for a termination detection protocol in which each process is only contacted once following termination. In addition we also present a definition of termination that does not depend on global state. This definition is based on the causal relationships between events and is stated in terms of Lamport's "happens before" relation. Because the protocol is also specified in causal terms, this definition can be easily used to formally argue the correctness of the algorithm.