메뉴 건너뛰기




Volumn 1, Issue , 2004, Pages 17-23

Install-time system for automatic generation of optimized parallel sorting algorithms

Author keywords

Hyperthreading; Install time optimization; Parallel sorting algorithms

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; MATHEMATICAL MODELS; SERVERS; SORTING;

EID: 12344325118     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (11)

References (9)
  • 6
    • 0022043139 scopus 로고
    • Tight bounds in the complexity of parallel sorting
    • Tom Leighton. Tight bounds in the complexity of parallel sorting. IEEE Transactions on Computers, 34:318-325, 1985.
    • (1985) IEEE Transactions on Computers , vol.34 , pp. 318-325
    • Leighton, T.1
  • 9
    • 0343462141 scopus 로고    scopus 로고
    • Automated empirical optimization of software and the ATLAS project
    • R. Clint Whaley, Antoine Petitet, and Jack Dongarra. Automated Empirical Optimization of Software and the ATLAS project. Parallel Computing, 27(1):3-35, 2001.
    • (2001) Parallel Computing , vol.27 , Issue.1 , pp. 3-35
    • Whaley, R.C.1    Petitet, A.2    Dongarra, J.3


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