{"title":"朝圣者:分布式共享内存的新一致性协议","authors":"H. Guyennet, J. Lapayre, M. Tréhel","doi":"10.1109/ICAPP.1997.651495","DOIUrl":null,"url":null,"abstract":"We propose a new consistency protocol named Pilgrim for distributed shared memory (DSM) where different shared objects are replicated at each site. This protocol provides both reliable consistency and guaranteed performance. This protocol is discussed and proved with a finite state automaton, and we demonstrate its qualities.","PeriodicalId":325978,"journal":{"name":"Proceedings of 3rd International Conference on Algorithms and Architectures for Parallel Processing","volume":"76 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"The Pilgrim: a new consistency protocol for distributed shared memory\",\"authors\":\"H. Guyennet, J. Lapayre, M. Tréhel\",\"doi\":\"10.1109/ICAPP.1997.651495\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a new consistency protocol named Pilgrim for distributed shared memory (DSM) where different shared objects are replicated at each site. This protocol provides both reliable consistency and guaranteed performance. This protocol is discussed and proved with a finite state automaton, and we demonstrate its qualities.\",\"PeriodicalId\":325978,\"journal\":{\"name\":\"Proceedings of 3rd International Conference on Algorithms and Architectures for Parallel Processing\",\"volume\":\"76 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-12-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 3rd International Conference on Algorithms and Architectures for Parallel Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAPP.1997.651495\",\"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 3rd International Conference on Algorithms and Architectures for Parallel Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAPP.1997.651495","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Pilgrim: a new consistency protocol for distributed shared memory
We propose a new consistency protocol named Pilgrim for distributed shared memory (DSM) where different shared objects are replicated at each site. This protocol provides both reliable consistency and guaranteed performance. This protocol is discussed and proved with a finite state automaton, and we demonstrate its qualities.