메뉴 건너뛰기




Volumn 1996-November, Issue , 1996, Pages

Dynamic computation migration in DSM systems

Author keywords

Coherence; Computation migration; Data migration; Replication

Indexed keywords

MEMORY ARCHITECTURE;

EID: 85117314468     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SUPERC.1996.183546     Document Type: Conference Paper
Times cited : (4)

References (19)
  • 3
    • 0015489880 scopus 로고
    • Organization and maintenance of large ordered indexes
    • R. Bayer and E.M. McCreight. Organization and Maintenance of Large Ordered Indexes. Acta Informatica, 1(3):173–189, 1972.
    • (1972) Acta Informatica , vol.1 , Issue.3 , pp. 173-189
    • Bayer, R.1    McCreight, E.M.2
  • 5
    • 0029354892 scopus 로고
    • Techniques for reducing consistency-related communication in distributed shared-memory systems
    • August
    • J.B. Carter, J.K. Bennett, and W. Zwaenepoel. Techniques for Reducing Consistency-Related Communication in Distributed Shared-Memory Systems. ACM Transactions on Computer Systems, 13(3):205–243, August 1995.
    • (1995) ACM Transactions on Computer Systems , vol.13 , Issue.3 , pp. 205-243
    • Carter, J.B.1    Bennett, J.K.2    Zwaenepoel, W.3
  • 6
    • 0002126972 scopus 로고
    • Cool: An object-based language for parallel programming
    • August
    • R. Chandra, A. Gupta, and J.L. Hennessy. COOL: An Object-Based Language for Parallel Programming. IEEE Computer, 27(8):13–26, August 1994.
    • (1994) IEEE Computer , vol.27 , Issue.8 , pp. 13-26
    • Chandra, R.1    Gupta, A.2    Hennessy, J.L.3
  • 10
  • 14
    • 0019666493 scopus 로고
    • Efficient locking for concurrent operations on B-trees
    • December
    • P.L. Lehman and S.B. Yao. Efficient Locking for Concurrent Operations on B-Trees. ACM Transactions on Database Systems, 6(4):650–670, December 1981.
    • (1981) ACM Transactions on Database Systems , vol.6 , Issue.4 , pp. 650-670
    • Lehman, P.L.1    Yao, S.B.2
  • 16
    • 0002255264 scopus 로고
    • Splash: Stanford parallel applications for shared memory
    • March
    • J.P. Singh, W. Weber, and A. Gupta. SPLASH: Stanford Parallel Applications for Shared Memory. Computer Architecture News, 20(1):5–44, March 1992.
    • (1992) Computer Architecture News , vol.20 , Issue.1 , pp. 5-44
    • Singh, J.P.1    Weber, W.2    Gupta, A.3
  • 17
    • 0027590139 scopus 로고
    • Limits to low-latency communication on high-speed networks
    • May
    • C.A. Thekkath and H.M. Levy. Limits to Low-Latency Communication on High-Speed Networks. ACM Transactions on Computer Systems, 11(2):179–203, May 1993.
    • (1993) ACM Transactions on Computer Systems , vol.11 , Issue.2 , pp. 179-203
    • Thekkath, C.A.1    Levy, H.M.2
  • 19
    • 0011458601 scopus 로고
    • Master’s thesis, Massachusetts Institute of Technology, January Available as MIT/LCS/TR-496
    • P. Wang. An In-Depth Analysis of Concurrent B-Tree Algorithms. Master’s thesis, Massachusetts Institute of Technology, January 1991. Available as MIT/LCS/TR-496.
    • (1991) An In-Depth Analysis of Concurrent B-Tree Algorithms
    • Wang, P.1


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