메뉴 건너뛰기




Volumn 16, Issue , 2004, Pages 235-244

Effectively sharing a cache among threads

Author keywords

Chip multiprocessors; Multithreaded architectures; Scheduling algorithms; Shared cache

Indexed keywords

COMPUTATION THEORY; LOGIC DESIGN; MICROPROCESSOR CHIPS; MULTIPROCESSING SYSTEMS; PROGRAM PROCESSORS; VIRTUAL STORAGE;

EID: 8344240379     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007912.1007948     Document Type: Conference Paper
Times cited : (76)

References (31)
  • 5
    • 0033713203 scopus 로고    scopus 로고
    • Application-controlled paging for a shared cache
    • R. D. Barve, E. F. Grove, and J. S. Vitter. Application-controlled paging for a shared cache. SIAM Journal on Computing, 29(4):1290-1303, 2000.
    • (2000) SIAM Journal on Computing , vol.29 , Issue.4 , pp. 1290-1303
    • Barve, R.D.1    Grove, E.F.2    Vitter, J.S.3
  • 6
    • 0003003638 scopus 로고
    • A study of replacment algorithms for virtual storage computers
    • L. A. Belady. A study of replacment algorithms for virtual storage computers. IBM Systems Journal, 5(2):78-101, 1966.
    • (1966) IBM Systems Journal , vol.5 , Issue.2 , pp. 78-101
    • Belady, L.A.1
  • 7
    • 0003575841 scopus 로고    scopus 로고
    • Provably efficient scheduling for languages with fine-grained parallelism
    • G. E. Blelloch, P. B. Gibbons, and Y. Matias. Provably efficient scheduling for languages with fine-grained parallelism. Journal of the ACM, 46(2):281-321, 1999.
    • (1999) Journal of the ACM , vol.46 , Issue.2 , pp. 281-321
    • Blelloch, G.E.1    Gibbons, P.B.2    Matias, Y.3
  • 10
    • 0000269759 scopus 로고    scopus 로고
    • Scheduling multithreaded computations by work stealing
    • R. D. Blumofe and C. E. Leiserson. Scheduling multithreaded computations by work stealing. Journal of the ACM, 46(5):720-748, 1999.
    • (1999) Journal of the ACM , vol.46 , Issue.5 , pp. 720-748
    • Blumofe, R.D.1    Leiserson, C.E.2
  • 12
    • 0034832577 scopus 로고    scopus 로고
    • Low-contention depth-first scheduling of parallel computations with write-once synchronization variables
    • July
    • P. Fatourou. Low-contention depth-first scheduling of parallel computations with write-once synchronization variables. In Proc. 13th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 189-198, July 2001.
    • (2001) Proc. 13th ACM Symp. on Parallel Algorithms and Architectures (SPAA) , pp. 189-198
    • Fatourou, P.1
  • 15
  • 16
    • 84958948520 scopus 로고    scopus 로고
    • Competitive analysis of paging
    • Springer. LNCS
    • S. Irani. Competitive analysis of paging. In Online Algorithms. Springer, 1998. LNCS, 1442:52-73.
    • (1998) Online Algorithms , vol.1442 , pp. 52-73
    • Irani, S.1
  • 17
    • 0025429331 scopus 로고
    • Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers
    • May
    • N. P. Jouppi. Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers. In Proc. 17th ACM International Symp. on Computer Architecture (ISCA), pages 364-373, May 1990.
    • (1990) Proc. 17th ACM International Symp. on Computer Architecture (ISCA) , pp. 364-373
    • Jouppi, N.P.1
  • 18
    • 4644226743 scopus 로고    scopus 로고
    • Simultaneous multi-threading implementation in POWER5
    • Aug.
    • R. Kalla, B. Sinharoy, and J. Tendler. Simultaneous multi-threading implementation in POWER5. In 15th IEEE Hot Chips, Aug. 2003.
    • (2003) 15th IEEE Hot Chips
    • Kalla, R.1    Sinharoy, B.2    Tendler, J.3
  • 21
    • 0036489340 scopus 로고    scopus 로고
    • Scheduling threads for low space requirement and good locality
    • G. J. Narlikar. Scheduling threads for low space requirement and good locality. Theory of Computing Systems, 35(2):151-187, 2002.
    • (2002) Theory of Computing Systems , vol.35 , Issue.2 , pp. 151-187
    • Narlikar, G.J.1
  • 24
    • 0022012946 scopus 로고
    • Amortized efficiency of list update and paging rules
    • D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28(2):202-208, 1985.
    • (1985) Communications of the ACM , vol.28 , Issue.2 , pp. 202-208
    • Sleator, D.D.1    Tarjan, R.E.2
  • 27
    • 8344224107 scopus 로고    scopus 로고
    • Power4 system microarchitecture, technical white paper
    • IBM Server Group, Oct.
    • J. M. Tendler, S. Dodson, S. Fields, H. Le, and B. Sinharoy. Power4 system microarchitecture, technical white paper. Technical Report 20, IBM Server Group, Oct. 2001.
    • (2001) Technical Report , vol.20
    • Tendler, J.M.1    Dodson, S.2    Fields, S.3    Le, H.4    Sinharoy, B.5
  • 29
    • 0026881152 scopus 로고
    • Improving disk cache hit-ratios through cache partitioning
    • D. Thibaut and H. S. Stone. Improving disk cache hit-ratios through cache partitioning. IEEE Transactions on Computers, 41(6):665-676, 1992.
    • (1992) IEEE Transactions on Computers , vol.41 , Issue.6 , pp. 665-676
    • Thibaut, D.1    Stone, H.S.2
  • 30
    • 0034316177 scopus 로고    scopus 로고
    • The MAJC architecture: A synthesis of parallelism and scalability
    • M. Tremblay, J. Chan, S. Chaudhry, A. W. Conigliaro, and S. S. Tse. The MAJC architecture: A synthesis of parallelism and scalability. IEEE Micro, 20(6): 12-25, 2000.
    • (2000) IEEE Micro , vol.20 , Issue.6 , pp. 12-25
    • Tremblay, M.1    Chan, J.2    Chaudhry, S.3    Conigliaro, A.W.4    Tse, S.S.5


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