메뉴 건너뛰기




Volumn Part F129425, Issue , 1994, Pages 118-127

Data relocation and prefetching for programs with large data sets

Author keywords

Cache conflicts; Data copying; Data relocation; Program optimization; Software prefetching

Indexed keywords

CACHE MEMORY; COMPUTER ARCHITECTURE; HARDWARE;

EID: 0006424869     PISSN: 10724451     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/192724.192740     Document Type: Conference Paper
Times cited : (2)

References (17)
  • 2
    • 0027764718 scopus 로고
    • To copy or not to copy: A compile-time technique for assessing when data copying should be used to eliminate cache conflicts
    • Los Alamitos, California, IEEE Computer Society Press, Nov
    • O. Temam, E. D. Granston, and W. Jalby, "To copy or not to copy: A compile-time technique for assessing when data copying should be used to eliminate cache conflicts", in Proceedings of Supercomputing '93, (Los Alamitos, California), pp. 410-419, IEEE Computer Society Press, Nov. 1993.
    • (1993) Proceedings of Supercomputing '93 , pp. 410-419
    • Temam, O.1    Granston, E.D.2    Jalby, W.3
  • 3
    • 1542423315 scopus 로고
    • ch. The influence of memory hierarchy on algorithm organization: Programming FFTs on a vector multiprocessor. MIT press
    • D. Gannon and W. Jalby, The characteristics of parallel programs, ch. The influence of memory hierarchy on algorithm organization: Programming FFTs on a vector multiprocessor. MIT press, 1987.
    • (1987) The Characteristics of Parallel Programs
    • Gannon, D.1    Jalby, W.2
  • 5
    • 0026157234 scopus 로고
    • Data prefetching in multiprocessor vector cache memories
    • Toronto, Canada, June
    • J. W. C. Fu and J. H. Patel, "Data prefetching in multiprocessor vector cache memories", in Proc. 18th Ann. Int'l Symp. Computer Architecture, (Toronto, Canada), pp. 54-63, June 1991.
    • (1991) Proc. 18th Ann. Int'l Symp. Computer Architecture , pp. 54-63
    • Fu, J.W.C.1    Patel, J.H.2
  • 6
    • 0026186269 scopus 로고
    • Compile-time partitioning of iterative parallel loops to reduce cache coherence traffic
    • S. G. Abraham and D. E. Hudak, "Compile-time partitioning of iterative parallel loops to reduce cache coherence traffic", J. Parallel and Distributed Computing, vol. 2, pp. 318-328, 1991.
    • (1991) J. Parallel and Distributed Computing , vol.2 , pp. 318-328
    • Abraham, S.G.1    Hudak, D.E.2
  • 7
    • 0026267802 scopus 로고
    • An effective on-chip preloading scheme to reduce data access penalty
    • Nov
    • J.-L. Baer and T.-F. Chen, "An effective on-chip preloading scheme to reduce data access penalty", in Proceeding of Supercomputing '91, pp. 176-186, Nov. 1991.
    • (1991) Proceeding of Supercomputing '91 , pp. 176-186
    • Baer, J.-L.1    Chen, T.-F.2
  • 13
    • 84976676720 scopus 로고
    • A practical algorithm for exact array dependence analysis
    • Aug
    • W. Pugh, "A practical algorithm for exact array dependence analysis", Communications of the ACM, vol. 35, pp. 102-114, Aug. 1992.
    • (1992) Communications of the ACM , vol.35 , pp. 102-114
    • Pugh, W.1
  • 16
    • 6144224602 scopus 로고
    • Tech. Rep, Center for Reliable and High-Performance Computing, University of Illinois, Urbana, IL
    • J. W. C. Fu and J. H. Patel, "How to simulate 100 billion references cheaply", Tech. Rep. CRHC-91-30, Center for Reliable and High-Performance Computing, University of Illinois, Urbana, IL, 1991.
    • (1991) How to Simulate 100 Billion References Cheaply
    • Fu, J.W.C.1    Patel, J.H.2
  • 17
    • 0017922490 scopus 로고
    • The Cray-1 computer system
    • Jan
    • R. M. Russell, "The Cray-1 computer system", Communications of the ACM, vol. 21, pp. 63-72, Jan. 1978.
    • (1978) Communications of the ACM , vol.21 , pp. 63-72
    • Russell, R.M.1


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