메뉴 건너뛰기




Volumn 31, Issue 9, 1996, Pages 222-233

Compiler-based prefetching for recursive data structures

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0012944190     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/248209.237190     Document Type: Article
Times cited : (65)

References (22)
  • 2
    • 0026267802 scopus 로고
    • An effective on-chip preloading scheme to reduce data access penalty
    • J.-L. Baer and T.-F. Chen. An effective on-chip preloading scheme to reduce data access penalty. In Proceedings of Supercomputing '91, 1991.
    • (1991) Proceedings of Supercomputing '91
    • Baer, J.-L.1    Chen, T.-F.2
  • 5
    • 84944799568 scopus 로고
    • Data access microarchitectures for superscalar processors with compiler-assisted data prefetching
    • W. Y. Chen, S. A. Mahlke, P. P. Chang, and W. W. Hwu. Data access microarchitectures for superscalar processors with compiler-assisted data prefetching. In Proceedings of Microcomputing 24, 1991.
    • (1991) Proceedings of Microcomputing 24
    • Chen, W.Y.1    Mahlke, S.A.2    Chang, P.P.3    Hwu, W.W.4
  • 6
    • 0027061682 scopus 로고
    • A storeless model of aliasing and its abstractions using finite respresentation of right-regular equivalence relations
    • April
    • A. Deutsch. A storeless model of aliasing and its abstractions using finite respresentation of right-regular equivalence relations. In Proceedings of the 1992 International Conference on Computer Languages, pages 2-13, April 1992.
    • (1992) Proceedings of the 1992 International Conference on Computer Languages , pp. 2-13
    • Deutsch, A.1
  • 18
    • 0010401153 scopus 로고
    • Technical Report CSL-TR-91-497, Stanford University, November
    • M. D. Smith. Tracing with pixie. Technical Report CSL-TR-91-497, Stanford University, November 1991.
    • (1991) Tracing with Pixie
    • Smith, M.D.1


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