{"title":"用于协作工作应用程序的分布式共享内存层","authors":"H. Guyennet, J. Lapayre, M. Tréhel","doi":"10.1109/LCN.1997.630906","DOIUrl":null,"url":null,"abstract":"To create cooperative work applications quickly and efficiently, we have developed a cooperative platform called CAliF: Cooperative Application Framework. This system was defined with four layers. We propose a new consistency protocol for the distributed shared memory (DSM) layer where different shared objects are replicated at each site. CAliF uses the DSM to allow programmers to share objects or variables without having to manage the exchange. We present an algorithm which uses the token technique. The token is a data structure which contains the updates of shared data. These data are carried through the ring on the token, named Pilgrim. The Pilgrim protocol provides both reliable consistency and guaranteed performance according to the type of application described. The protocol is discussed and proved, and we demonstrate its qualities.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Distributed shared memory layer for cooperative work applications\",\"authors\":\"H. Guyennet, J. Lapayre, M. Tréhel\",\"doi\":\"10.1109/LCN.1997.630906\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To create cooperative work applications quickly and efficiently, we have developed a cooperative platform called CAliF: Cooperative Application Framework. This system was defined with four layers. We propose a new consistency protocol for the distributed shared memory (DSM) layer where different shared objects are replicated at each site. CAliF uses the DSM to allow programmers to share objects or variables without having to manage the exchange. We present an algorithm which uses the token technique. The token is a data structure which contains the updates of shared data. These data are carried through the ring on the token, named Pilgrim. The Pilgrim protocol provides both reliable consistency and guaranteed performance according to the type of application described. The protocol is discussed and proved, and we demonstrate its qualities.\",\"PeriodicalId\":286255,\"journal\":{\"name\":\"Proceedings of 22nd Annual Conference on Local Computer Networks\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-11-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 22nd Annual Conference on Local Computer Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN.1997.630906\",\"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 22nd Annual Conference on Local Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.1997.630906","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Distributed shared memory layer for cooperative work applications
To create cooperative work applications quickly and efficiently, we have developed a cooperative platform called CAliF: Cooperative Application Framework. This system was defined with four layers. We propose a new consistency protocol for the distributed shared memory (DSM) layer where different shared objects are replicated at each site. CAliF uses the DSM to allow programmers to share objects or variables without having to manage the exchange. We present an algorithm which uses the token technique. The token is a data structure which contains the updates of shared data. These data are carried through the ring on the token, named Pilgrim. The Pilgrim protocol provides both reliable consistency and guaranteed performance according to the type of application described. The protocol is discussed and proved, and we demonstrate its qualities.