메뉴 건너뛰기




Volumn , Issue , 2003, Pages 285-294

Automatic Fence Insertion for Shared Memory Multiprocessing

Author keywords

Compilers; Consistency Models; Java

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; COMPUTER HARDWARE; DATA REDUCTION; JAVA PROGRAMMING LANGUAGE; OPTIMIZATION; PROGRAM COMPILERS; SYNCHRONIZATION;

EID: 1142280971     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/782852.782854     Document Type: Conference Paper
Times cited : (64)

References (23)
  • 8
    • 26144452331 scopus 로고    scopus 로고
    • Inserting fences to guarantee sequential consistency
    • Master's thesis, Department of Computer Science and Engineering, Michigan State University, August
    • Xing Fang. Inserting fences to guarantee sequential consistency. Master's thesis, Department of Computer Science and Engineering, Michigan State University, August 2002. Technical Report MSU-CSE-02-27.
    • (2002) Technical Report , vol.MSU-CSE-02-27
    • Fang, X.1
  • 11
    • 0004029273 scopus 로고
    • Cache consistency and sequential consistency
    • Department of Computer Science, University of Wisconsin, February
    • James R. Goodman. Cache consistency and sequential consistency. Technical Report CS-TR-91-1006, Department of Computer Science, University of Wisconsin, February 1991.
    • (1991) Technical Report , vol.CS-TR-91-1006
    • Goodman, J.R.1
  • 13
    • 0018518477 scopus 로고
    • How to make a multiprocessor computer that correctly executes multiprocess programs
    • September
    • Leslie Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers, C-28(9):690-691, September 1979.
    • (1979) IEEE Transactions on Computers , vol.C-28 , Issue.9 , pp. 690-691
    • Lamport, L.1
  • 14
    • 0003390866 scopus 로고    scopus 로고
    • Compilation Techniques for Explicitly Parallel Programs
    • PhD thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, October
    • Jaejin Lee. Compilation Techniques for Explicitly Parallel Programs. PhD thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, October 1999. Technical Report UIUCDCS-R-99-2112.
    • (1999) Technical Report , vol.UIUCDCS-R-99-2112
    • Lee, J.1
  • 18
    • 0023142868 scopus 로고
    • On reducing data synchronization in multiprocessed loops
    • January
    • Zhiyuan Li and Walid Abu-sufah. On reducing data synchronization in multiprocessed loops. IEEE Transactions on Computers, C-36(1):105-109, January 1987.
    • (1987) IEEE Transactions on Computers , vol.C-36 , Issue.1 , pp. 105-109
    • Li, Z.1    Abu-Sufah, W.2
  • 20
    • 0023538229 scopus 로고
    • Compiler algorithms for synchronization
    • December
    • Samuel P. Midkiff and David A. Padua. Compiler algorithms for synchronization. IEEE Transactions on Computers, C-36(12):1485-1495, December 1987.
    • (1987) IEEE Transactions on Computers , vol.C-36 , Issue.12 , pp. 1485-1495
    • Midkiff, S.P.1    Padua, D.A.2
  • 22
    • 0023994389 scopus 로고
    • Efficient and correct execution of parallel programs that share memory
    • April
    • Dennis Shasha and Marc Snir. Efficient and correct execution of parallel programs that share memory. A CM Transactions on Programming Languages and Systems, 10(2):282-312, April 1988.
    • (1988) ACM Transactions on Programming Languages and Systems , vol.10 , Issue.2 , pp. 282-312
    • Shasha, D.1    Snir, M.2


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