{"title":"弱一致性对分布式共享内存系统的好处","authors":"L. Borrmann, P. Istavrinos","doi":"10.1109/DMCC.1991.633356","DOIUrl":null,"url":null,"abstract":"This paper describes a new scheme for weakly coherent, distributed shared memory systems. It shows that for most applications the semantics of weak coherence are sufficient. After sketching the bmic implementation schemes for weak coherence protocols it presents their benefits, mainly an improved exploitation of parallelism. Not only latency masking for write operations is exploited but also techniques like accumulating u,pdate and invalidation messages are introduced. First results ofa prototype implementation are given.","PeriodicalId":313314,"journal":{"name":"The Sixth Distributed Memory Computing Conference, 1991. Proceedings","volume":"195 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Benefits of Weak Coherence for Distributed shared Memory Systems\",\"authors\":\"L. Borrmann, P. Istavrinos\",\"doi\":\"10.1109/DMCC.1991.633356\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes a new scheme for weakly coherent, distributed shared memory systems. It shows that for most applications the semantics of weak coherence are sufficient. After sketching the bmic implementation schemes for weak coherence protocols it presents their benefits, mainly an improved exploitation of parallelism. Not only latency masking for write operations is exploited but also techniques like accumulating u,pdate and invalidation messages are introduced. First results ofa prototype implementation are given.\",\"PeriodicalId\":313314,\"journal\":{\"name\":\"The Sixth Distributed Memory Computing Conference, 1991. Proceedings\",\"volume\":\"195 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-04-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Sixth Distributed Memory Computing Conference, 1991. Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DMCC.1991.633356\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Sixth Distributed Memory Computing Conference, 1991. Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DMCC.1991.633356","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Benefits of Weak Coherence for Distributed shared Memory Systems
This paper describes a new scheme for weakly coherent, distributed shared memory systems. It shows that for most applications the semantics of weak coherence are sufficient. After sketching the bmic implementation schemes for weak coherence protocols it presents their benefits, mainly an improved exploitation of parallelism. Not only latency masking for write operations is exploited but also techniques like accumulating u,pdate and invalidation messages are introduced. First results ofa prototype implementation are given.