메뉴 건너뛰기




Volumn 17, Issue 6, 2002, Pages 359-365

Token-based sequential consistency

Author keywords

Asynchronous distributed systems; Message passing; Sequential consistency; Shared memory abstraction; Token

Indexed keywords

CONCURRENT ENGINEERING; NETWORK PROTOCOLS; OBJECT ORIENTED PROGRAMMING; REAL TIME SYSTEMS; SEQUENTIAL MACHINES; STORAGE ALLOCATION (COMPUTER);

EID: 0037624514     PISSN: 02676192     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (8)

References (22)
  • 1
    • 0038462766 scopus 로고    scopus 로고
    • Shared memory models: A tutorial
    • Adve S.V. and Garachorloo K., Shared Memory Models: a Tutorial. IEEE Computer, 29(12):66-77, 1997.
    • (1997) IEEE Computer , vol.29 , Issue.12 , pp. 66-77
    • Adve, S.V.1    Garachorloo, K.2
  • 4
    • 0031646058 scopus 로고    scopus 로고
    • An adaptive protocol for implementing causally consistent distributed services
    • IEEE Computer Society Press; Amsterdam (Netherland)
    • Ahamad M., Raynal M. and Thia-Kime G., An Adaptive Protocol for Implementing Causally Consistent Distributed Services. Proc. 18th IEEE Int. Conf. on Distributed Computing Systems, IEEE Computer Society Press, pp. 86-93. Amsterdam (Netherland), 1998.
    • (1998) Proc. 18th IEEE Int. Conf. on Distributed Computing Systems , pp. 86-93
    • Ahamad, M.1    Raynal, M.2    Thia-Kime, G.3
  • 7
    • 0032691683 scopus 로고    scopus 로고
    • Normality: A correctness condition for concurrent objects
    • Garg V.K. and Raynal M., Normality: a Correctness Condition for Concurrent Objects. Parallel Processing Letters. 9(1):123-134, 1999.
    • (1999) Parallel Processing Letters , vol.9 , Issue.1 , pp. 123-134
    • Garg, V.K.1    Raynal, M.2
  • 11
    • 0018518477 scopus 로고
    • How to make a multiprocessor computer that correctly executes multiprocess programs
    • Lamport L., How to Make a Multiprocessor Computer that Correctly Executes Multiprocess Programs. IEEE Transactions on Computers, C28(9):690-691, 1979.
    • (1979) IEEE Transactions on Computers , vol.C28 , Issue.9 , pp. 690-691
    • Lamport, L.1
  • 12
    • 0031646051 scopus 로고    scopus 로고
    • Consistency conditions for multi-object distributed operations
    • IEEE Computer Society Press; Amsterdam (Netherlands)
    • Mittal N. and Garg V.K., Consistency Conditions for Multi-Object Distributed Operations, Proc. 18th IEEE Int. Conf. on Distributed Computing Systems, IEEE Computer Society Press, pp. 582-589, Amsterdam (Netherlands), 1998.
    • (1998) Proc. 18th IEEE Int. Conf. on Distributed Computing Systems , pp. 582-589
    • Mittal, N.1    Garg, V.K.2
  • 13
    • 0022582940 scopus 로고
    • Axioms for memory access in asynchronous hardware systems
    • J. Misra. Axioms for Memory Access in Asynchronous Hardware Systems. Transactions on Programming Language and Systems, 8(1):142-153, 1986.
    • (1986) Transactions on Programming Language and Systems , vol.8 , Issue.1 , pp. 142-153
    • Misra, J.1
  • 15
    • 0038462759 scopus 로고    scopus 로고
    • An optimistic protocol for a linearizable distributed shared memory system
    • Mizuno M., Nielsen M.L. and Raynal M., An Optimistic Protocol for a Linearizable Distributed Shared Memory System. Parallel Processing Letters, 6(2):265-278, 1996.
    • (1996) Parallel Processing Letters , vol.6 , Issue.2 , pp. 265-278
    • Mizuno, M.1    Nielsen, M.L.2    Raynal, M.3
  • 16
    • 0023577403 scopus 로고
    • An improvement of the distributed mutual exclusion algorithm
    • IEEE Computer Society Press; Berlin (Germany)
    • Naimi M. and Trehel M., An Improvement of the Distributed Mutual Exclusion Algorithm. Proc. 7th IEEE Int. Conf. on Distributed Computing Systems (ICDCS'87), IEEE Computer Society Press, pp. 371-375, Berlin (Germany), 1987.
    • (1987) Proc. 7th IEEE Int. Conf. on Distributed Computing Systems (ICDCS'87) , pp. 371-375
    • Naimi, M.1    Trehel, M.2
  • 17
    • 0024607971 scopus 로고
    • A tree-based algorithm for distributed mutual exclusion
    • Raymond K., A Tree-Based Algorithm for Distributed Mutual Exclusion. ACM Transactions on Computer Systems, 7(1):61-77, 1989.
    • (1989) ACM Transactions on Computer Systems , vol.7 , Issue.1 , pp. 61-77
    • Raymond, K.1
  • 21
    • 0026219782 scopus 로고
    • The causal ordering abstraction and a simple way to implement it
    • Raynal M., Schiper A. and Toueg S., The causal Ordering Abstraction and a Simple Way to Implement it. Information Processing Letters, 39:343-351, 1991.
    • (1991) Information Processing Letters , vol.39 , pp. 343-351
    • Raynal, M.1    Schiper, A.2    Toueg, S.3
  • 22
    • 0020736536 scopus 로고
    • Complexity of analyzing the synchronization structure of concurrent programs
    • Taylor R.N., Complexity of Analyzing the Synchronization Structure of Concurrent Programs. Acta Informatica, 19:57-84, 1983.
    • (1983) Acta Informatica , vol.19 , pp. 57-84
    • Taylor, R.N.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.