DocumentCode
2027836
Title
Invariant consistency: a mechanism for inter-process ordering in distributed shared memory systems
Author
Singh, Gurdip
Author_Institution
Dept. of Comput. & Inf. Sci., Kansas State Univ., Manhattan, KS, USA
fYear
2002
fDate
2002
Firstpage
447
Lastpage
448
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 countl 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.
Keywords
data integrity; distributed programming; distributed shared memory systems; protocols; data consistency protocol; distributed shared memory systems; inter-process ordering; invariant consistency; Access protocols; Concurrent computing; Contracts; Counting circuits; Distributed computing; Message passing; Multiprocessing systems; Multiprocessor interconnection networks; Programming profession; Sufficient conditions;
fLanguage
English
Publisher
ieee
Conference_Titel
Distributed Computing Systems, 2002. Proceedings. 22nd International Conference on
ISSN
1063-6927
Print_ISBN
0-7695-1585-1
Type
conf
DOI
10.1109/ICDCS.2002.1022285
Filename
1022285
Link To Document