메뉴 건너뛰기




Volumn 2003-January, Issue , 2003, Pages 300-307

Efficient parallel out-of-core matrix transposition

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER COMPUTING; COMPUTER ARCHITECTURE; MATRIX ALGEBRA;

EID: 33646714072     PISSN: 15525244     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CLUSTR.2003.1253328     Document Type: Conference Paper
Times cited : (5)

References (20)
  • 1
    • 0016567155 scopus 로고
    • A computer algorithm for transposing nonsquare arrays
    • W. O. Alltop. A computer algorithm for transposing nonsquare arrays. IEEE Transactions on Computers, 24(10):1038-1040, 1975.
    • (1975) IEEE Transactions on Computers , vol.24 , Issue.10 , pp. 1038-1040
    • Alltop, W.O.1
  • 2
    • 0018907742 scopus 로고
    • A stepwise approach to computing the multidimensional fast fourier transform of large arrays
    • G. L. Anderson. A stepwise approach to computing the multidimensional fast Fourier transform of large arrays. IEEE Transactions on Acoustics and Speech Signal Processing, 28(3):280-284, 1980.
    • (1980) IEEE Transactions on Acoustics and Speech Signal Processing , vol.28 , Issue.3 , pp. 280-284
    • Anderson, G.L.1
  • 3
    • 0025403252 scopus 로고
    • FFTs in external or hierarchical memory
    • D. H. Bailey. FFTs in external or hierarchical memory. Journal of Supercomputing, 4(1):23-35, 1990.
    • (1990) Journal of Supercomputing , vol.4 , Issue.1 , pp. 23-35
    • Bailey, D.H.1
  • 9
    • 0032057868 scopus 로고    scopus 로고
    • Asymptotically tight bounds for performing BMMC permutations on parallel disk systems
    • T. H. Cormen, T. Sundquist, and L. F. Wisniewski. Asymptotically tight bounds for performing BMMC permutations on parallel disk systems. SIAM Journal on Computing, 28(1):105-136, 1998.
    • (1998) SIAM Journal on Computing , vol.28 , Issue.1 , pp. 105-136
    • Cormen, T.H.1    Sundquist, T.2    Wisniewski, L.F.3
  • 11
    • 0000011164 scopus 로고
    • A fast computer method for matrix transposing
    • J. O. Eklundh. A fast computer method for matrix transposing. IEEE Transactions on Computers, 20(7):801-803, 1972.
    • (1972) IEEE Transactions on Computers , vol.20 , Issue.7 , pp. 801-803
    • Eklundh, J.O.1
  • 14
    • 84944907858 scopus 로고    scopus 로고
    • NWChem. http://www.emsl.pnl.gov:2080/docs/nwchem/nwchem.html.
    • NWChem
  • 15
    • 84944917949 scopus 로고    scopus 로고
    • Ohio Supercomputing Center. http://www.osc.edu.
  • 16
    • 0016657275 scopus 로고
    • A generalization of eklundh's algorithm for transposing large matrices
    • H. K. Ramapriyan. A generalization of Eklundh's algorithm for transposing large matrices. IEEE Transactions on Computers, 24(12):1221-1226, 1975.
    • (1975) IEEE Transactions on Computers , vol.24 , Issue.12 , pp. 1221-1226
    • Ramapriyan, H.K.1
  • 17
    • 0036538429 scopus 로고    scopus 로고
    • An efficient algorithm for out-of-core matrix transposition
    • April
    • J. Suh and V. K. Prasanna. An efficient algorithm for out-of-core matrix transposition. IEEE Transactions on Computers, 51(4):420-438, April 2002.
    • (2002) IEEE Transactions on Computers , vol.51 , Issue.4 , pp. 420-438
    • Suh, J.1    Prasanna, V.K.2
  • 19
    • 0016994662 scopus 로고
    • An extension of eklundh's matrix transposition algorithm and its application to digital signal processing
    • R. E. Twogood and M. P. Ekstrom. An extension of Eklundh's matrix transposition algorithm and its application to digital signal processing. IEEE Transactions on Computers, 25(12):950-952, 1976.
    • (1976) IEEE Transactions on Computers , vol.25 , Issue.12 , pp. 950-952
    • Twogood, R.E.1    Ekstrom, M.P.2
  • 20
    • 0028484243 scopus 로고
    • Algorithms for parallel memory I: Two-level memories
    • J. S. Vitter and E. A. M. Shriver. Algorithms for parallel memory I: Two-level memories. Algorithmica, 12(2-3):110-147, 1994.
    • (1994) Algorithmica , vol.12 , Issue.2-3 , pp. 110-147
    • Vitter, J.S.1    Shriver, E.A.M.2


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