메뉴 건너뛰기




Volumn , Issue , 2012, Pages 659-664

Thread affinity mapping for irregular data access on shared cache GPGPU

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENT THREADS; DATA SHARING; IRREGULAR DATA; MANY-CORE; MAPPING METHODOLOGY; MEMORY ACCESS; MEMORY BOTTLENECK; ON CHIPS; PERFORMANCE BENEFITS; RUNTIMES; SHARED CACHE; TEST CASE;

EID: 84860003663     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASPDAC.2012.6165038     Document Type: Conference Paper
Times cited : (10)

References (20)
  • 1
    • 77951154340 scopus 로고    scopus 로고
    • The Gpu Computing Era
    • Mar-Apr
    • J. Nickolls and W. J. Dally, "The Gpu Computing Era," IEEE Micro, vol. 30, pp. 56-69, Mar-Apr 2010.
    • (2010) IEEE Micro , vol.30 , pp. 56-69
    • Nickolls, J.1    Dally, W.J.2
  • 2
    • 78149258346 scopus 로고    scopus 로고
    • Understanding Throughput-Oriented Architectures
    • Nov
    • M. Garland and D. B. Kirk, "Understanding Throughput-Oriented Architectures," Communications of the Acm, vol. 53, pp. 58-66, Nov 2010.
    • (2010) Communications of the Acm , vol.53 , pp. 58-66
    • Garland, M.1    Kirk, D.B.2
  • 15
    • 51549120204 scopus 로고    scopus 로고
    • Towards acceleration of fault simulation using Graphics Processing Units
    • K. Gulati and S. P. Khatri, "Towards acceleration of fault simulation using Graphics Processing Units," in 2008 45th Acm/Ieee Design Automation Conference, Vols 1 and 2, 2008, pp. 822-827.
    • (2008) 2008 45th Acm/Ieee Design Automation Conference , vol.1-2 , pp. 822-827
    • Gulati, K.1    Khatri, S.P.2
  • 16
    • 84990479742 scopus 로고
    • An Efficient Heuristic Procedure for Partitioning Graphs
    • B. W. Kernighan and B. Lin, "An Efficient Heuristic Procedure for Partitioning Graphs," The Bell system technical journal, vol. 49, pp. 291-307, 1970.
    • (1970) The Bell System Technical Journal , vol.49 , pp. 291-307
    • Kernighan, B.W.1    Lin, B.2
  • 18
    • 0032131147 scopus 로고    scopus 로고
    • A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
    • G. Karypis and V. Kumar, "A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs," SIAM J. Sci. Comput., vol. 20, pp. 359-392, 1998.
    • (1998) SIAM J. Sci. Comput. , vol.20 , pp. 359-392
    • Karypis, G.1    Kumar, V.2
  • 19
    • 70449461110 scopus 로고    scopus 로고
    • Available
    • ITC'99 Benchmarks. Available: http://www.cad.polito.it/downloads/tools/ itc99.html
    • ITC'99 Benchmarks


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