메뉴 건너뛰기




Volumn 18, Issue 12, 2006, Pages 1613-1656

Revocation techniques for Java concurrency

Author keywords

Atomicity; Concurrency; Isolation; Java; Speculation; Synchronization

Indexed keywords

ABSTRACTING; AUTOMATION; COMPUTER SYSTEM RECOVERY; CONCURRENT ENGINEERING; INTERCONNECTION NETWORKS; PERT; SEMANTICS; SYNCHRONIZATION;

EID: 33749359469     PISSN: 15320626     EISSN: 15320634     Source Type: Journal    
DOI: 10.1002/cpe.1008     Document Type: Article
Times cited : (4)

References (43)
  • 7
    • 0025488794 scopus 로고
    • Priority inheritance protocols: An approach to real-time synchronization
    • Sha L, Rajkumar R, Lehoczky JP. Priority inheritance protocols: An approach to real-time synchronization. IEEE Transactions on Computers 1990; 29(9):1175-1185.
    • (1990) IEEE Transactions on Computers , vol.29 , Issue.9 , pp. 1175-1185
    • Sha, L.1    Rajkumar, R.2    Lehoczky, J.P.3
  • 8
    • 0005307288 scopus 로고
    • Transaction processing: Concepts and techniques
    • Morgan Kaufmann: San Mateo, CA
    • Gray J, Reuter A. Transaction processing: Concepts and techniques. Data Management Systems. Morgan Kaufmann: San Mateo, CA. 1993.
    • (1993) Data Management Systems
    • Gray, J.1    Reuter, A.2
  • 15
    • 0003610530 scopus 로고
    • Also published as MIT Laboratory for Computer Science, Cambridge, MA
    • (Also published as Technical Report 260, MIT Laboratory for Computer Science, Cambridge, MA, 1981.)
    • (1981) Technical Report , vol.260
  • 18
    • 84969375781 scopus 로고
    • Efficient optimistic concurrency control using loosely synchronized clocks
    • Adya A, Gruber R, Liskov B, Maheshwari U. Efficient optimistic concurrency control using loosely synchronized clocks. ACM SIGMOD Record 1990; 24(2):23-34.
    • (1990) ACM SIGMOD Record , vol.24 , Issue.2 , pp. 23-34
    • Adya, A.1    Gruber, R.2    Liskov, B.3    Maheshwari, U.4
  • 19
    • 0025399444 scopus 로고
    • Apologizing versus asking permission: Optimistic concurrency control for abstract data types
    • Herlihy M. Apologizing versus asking permission: Optimistic concurrency control for abstract data types. ACM Transactions on Database Systems 1995; 15(1):96-124.
    • (1995) ACM Transactions on Database Systems , vol.15 , Issue.1 , pp. 96-124
    • Herlihy, M.1
  • 20
    • 0003980387 scopus 로고    scopus 로고
    • Stonebraker M, Hellerstein J (eds.). Morgan Kaufmann: San Mateo, CA
    • Stonebraker M, Hellerstein J (eds.). Readings in Database Systems (3rd edn). Morgan Kaufmann: San Mateo, CA, 1998.
    • (1998) Readings in Database Systems (3rd Edn)
  • 23
    • 0004177551 scopus 로고
    • A new approach to exclusive data access in shared memory multiprocessors
    • Lawrence Livermore National Laboratories
    • Jensen EH, Hagensen GW, Broughton JM. A new approach to exclusive data access in shared memory multiprocessors. Technical Report, Lawrence Livermore National Laboratories, 1987.
    • (1987) Technical Report
    • Jensen, E.H.1    Hagensen, G.W.2    Broughton, J.M.3
  • 28
    • 0000151487 scopus 로고    scopus 로고
    • Effective fine-grained synchronization for automatically parallelized programs using optimistic synchronization primitives
    • Rinard M. Effective fine-grained synchronization for automatically parallelized programs using optimistic synchronization primitives. ACM Transactions on Computer Systems 1999; 17(4):337-371.
    • (1999) ACM Transactions on Computer Systems , vol.17 , Issue.4 , pp. 337-371
    • Rinard, M.1
  • 36
    • 21344469440 scopus 로고    scopus 로고
    • Abstractions for fault-tolerant computing
    • Department of Computer Science, Stevens Institute of Technology
    • Choithia T, Duggan D. Abstractions for fault-tolerant computing. Technical Report 2003-3, Department of Computer Science, Stevens Institute of Technology, 2003.
    • (2003) Technical Report , vol.2003 , Issue.3
    • Choithia, T.1    Duggan, D.2
  • 39
    • 0036037050 scopus 로고    scopus 로고
    • On the serializability of transactions in shared dataspaces with temporary data
    • ACM Press: New York
    • Busi N, Zavattaro G. On the serializability of transactions in shared dataspaces with temporary data. Proceedings of the ACM Symposium on Applied Computing. ACM Press: New York, 2002; 359-366.
    • (2002) Proceedings of the ACM Symposium on Applied Computing , pp. 359-366
    • Busi, N.1    Zavattaro, G.2
  • 41
    • 0012661485 scopus 로고    scopus 로고
    • The two-phase commitment protocol in an extended pi-calculus
    • Elsevier: Amsterdam
    • Berger M, Honda K. The two-phase commitment protocol in an extended pi-calculus. Satellite Workshops from CONCUR 2000, vol. 39. Elsevier: Amsterdam, 2000.
    • (2000) Satellite Workshops from CONCUR 2000 , vol.39
    • Berger, M.1    Honda, K.2


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