메뉴 건너뛰기




Volumn , Issue , 2009, Pages 41-50

A study on optimally co-scheduling jobs of different lengths on chip multiprocessors

Author keywords

A* search; Cache contention; CMP scheduling; Co scheduling; Perfect matching

Indexed keywords

CACHE CONTENTION; CO-SCHEDULING; HIGH SCALABILITIES; ON-CHIP MULTIPROCESSOR; OPTIMAL SCHEDULE; ORDERS OF MAGNITUDE; PERFECT MATCHINGS; PROGRAM PERFORMANCE;

EID: 84855812515     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1531743.1531752     Document Type: Conference Paper
Times cited : (37)

References (28)
  • 16
    • 84885733230 scopus 로고    scopus 로고
    • Enhancements for hyperthreading technology in the operating system -seeking the optimal scheduling
    • Nakijima and Pallipadi. Enhancements for hyperthreading technology in the operating system -seeking the optimal scheduling. In Proceedings of USENIX Annual Technical Conference, 2002.
    • (2002) Proceedings of USENIX Annual Technical Conference
    • Nakijima1    Pallipadi2
  • 18
    • 34548042910 scopus 로고    scopus 로고
    • Utility-based cache partitioning: A low-overhead, high-performance, runtime mechanism to partition shared caches
    • M. K. Qureshi and Y. N. Patt. Utility-based cache partitioning: A low-overhead, high-performance, runtime mechanism to partition shared caches. In Proceedings of the International Symposium on Microarchitecture, 2006.
    • (2006) Proceedings of the International Symposium on Microarchitecture
    • Qureshi, M.K.1    Patt, Y.N.2
  • 23
    • 0034443570 scopus 로고    scopus 로고
    • Symbiotic jobscheduling for a simultaneous multithreading processor
    • A. Snavely and D.M. Tullsen. Symbiotic jobscheduling for a simultaneous multithreading processor. In Proceedings of ASPLOS, 2000.
    • (2000) Proceedings of ASPLOS
    • Snavely, A.1    Tullsen, D.M.2


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