Invariant consistency: a mechanism for inter-process ordering in distributed shared memory systems
Tóm tắt
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.
Từ khóa
#Programming profession #Access protocols #Concurrent computing #Multiprocessing systems #Counting circuits #Distributed computing #Multiprocessor interconnection networks #Message passing #Sufficient conditions #ContractsTài liệu tham khảo
10.1145/30350.30377
10.1007/BF01783663
10.1109/ISCA.1990.134502
10.1145/72935.72958