{"title":"不变一致性:分布式共享内存系统中进程间排序的机制","authors":"Gurdip Singh","doi":"10.1109/ICDCS.2002.1022285","DOIUrl":null,"url":null,"abstract":"We propose the notion of invariant consistency that allows programmers to specify inter-process ordering requirements. In our approach, we allow a programmer to label a program and provide an ordering specification. In particular, we associate a counter count/sub l/ with each label l that counts the number of times the operation labeled l has been executed. The ordering specification is given by an invariant on these counters.","PeriodicalId":186210,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Invariant consistency: a mechanism for inter-process ordering in distributed shared memory systems\",\"authors\":\"Gurdip Singh\",\"doi\":\"10.1109/ICDCS.2002.1022285\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose the notion of invariant consistency that allows programmers to specify inter-process ordering requirements. In our approach, we allow a programmer to label a program and provide an ordering specification. In particular, we associate a counter count/sub l/ with each label l that counts the number of times the operation labeled l has been executed. The ordering specification is given by an invariant on these counters.\",\"PeriodicalId\":186210,\"journal\":{\"name\":\"Proceedings 22nd International Conference on Distributed Computing Systems\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-07-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 22nd International Conference on Distributed Computing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDCS.2002.1022285\",\"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 22nd International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.2002.1022285","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Invariant consistency: a mechanism for inter-process ordering in distributed shared memory systems
We propose the notion of invariant consistency that allows programmers to specify inter-process ordering requirements. In our approach, we allow a programmer to label a program and provide an ordering specification. In particular, we associate a counter count/sub l/ with each label l that counts the number of times the operation labeled l has been executed. The ordering specification is given by an invariant on these counters.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
