메뉴 건너뛰기




Volumn , Issue , 2003, Pages 144-154

QR factorization with Morton-ordered quadtree matrices for memory re-use and parallelism

Author keywords

Cache misses; Indexing; Paging; Quadtrees; Storage management; Swapping

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); DATA STORAGE EQUIPMENT;

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

References (27)
  • 1
    • 0029193089 scopus 로고
    • LogGP: Incorporating long messages into the LogP model - One step closer towards a realistic model for parallel computation
    • ACM Press, New York, June
    • A. Alexandrov, M. F. Ionescu, K. E. Schauser, and C. Scheiman. LogGP: Incorporating long messages into the LogP model - one step closer towards a realistic model for parallel computation. In Proc. 7th ACM Symp. on Parallel Algorithms and Architectures, pages 95-105. ACM Press, New York, June 1995. http://doi.acm.org/10.1145/215399.215427
    • (1995) Proc. 7th ACM Symp. on Parallel Algorithms and Architectures , pp. 95-105
    • Alexandrov, A.1    Ionescu, M.F.2    Schauser, K.E.3    Scheiman, C.4
  • 4
    • 0030661485 scopus 로고    scopus 로고
    • Optimizing matrix multiply using PHiPAC: A portable, high-performance, ANSI C coding methodology
    • ACM Press, New York, July
    • J. Bilmes, K. Asanović, C.-W. Chin, and J. Demmel. Optimizing matrix multiply using PHiPAC: a portable, high-performance, ANSI C coding methodology. In Proc. '97 Int. Conf. on Supercomputing, pages 340-347. ACM Press, New York, July 1997. http://doi.acm.org/10.1145/263580.263662
    • (1997) Proc. '97 Int. Conf. on Supercomputing , pp. 340-347
    • Bilmes, J.1    Asanović, K.2    Chin, C.-W.3    Demmel, J.4
  • 6
    • 0017419683 scopus 로고
    • A transformation system for developing recursive programs
    • Jan.
    • R. M. Burstall and J. Darlington. A transformation system for developing recursive programs. J. ACM, 24(1):44-67, Jan. 1977. http://doi.acm.org/10.1145/321992.321996
    • (1977) J. ACM , vol.24 , Issue.1 , pp. 44-67
    • Burstall, R.M.1    Darlington, J.2
  • 7
    • 0036870763 scopus 로고    scopus 로고
    • Recursive array layouts and fast parallel matrix multiplication
    • Nov.
    • S. Chatterjee, A. R. Lebeck, P. K. Patnala, and M. Thottenthodi. Recursive array layouts and fast parallel matrix multiplication. IEEE Trans. Parallel Distrib. Syst., 13(11):1105-1123, Nov. 2002. http://www.computer.org/tpds/td2002/11009abs.htm
    • (2002) IEEE Trans. Parallel Distrib. Syst. , vol.13 , Issue.11 , pp. 1105-1123
    • Chatterjee, S.1    Lebeck, A.R.2    Patnala, P.K.3    Thottenthodi, M.4
  • 9
    • 0037660035 scopus 로고
    • chapter 1, pages 1-25. In Kronsjö and Shumsheruddin [19]
    • M. Cole. Parallel Software Designs, chapter 1, pages 1-25. In Kronsjö and Shumsheruddin [19], 1992.
    • (1992) Parallel Software Designs
    • Cole, M.1
  • 11
    • 0034224207 scopus 로고    scopus 로고
    • Applying recursion to serial and parallel QR factorization leads to better performance
    • July
    • E. Elmroth and F. Gustavson. Applying recursion to serial and parallel QR factorization leads to better performance. IBM J. Res. Develop., 44(4):605-624, July 2000. http://www.research.ibm.com/journal/rd/444/elmroth.html
    • (2000) IBM J. Res. Develop. , vol.44 , Issue.4 , pp. 605-624
    • Elmroth, E.1    Gustavson, F.2
  • 12
    • 0037997839 scopus 로고    scopus 로고
    • Matrix factorization using a block-recursive structure and block-recursive algorithms
    • PhD thesis, Indiana University, Computer Science Department, Sept.
    • J. D. Frens. Matrix Factorization Using a Block-Recursive Structure and Block-Recursive Algorithms. PhD thesis, Indiana University, Computer Science Department, Sept. 2002. Available as Techical Report # 568. http://cs.indiana.edu/Research/techreport/TR588.shtml.
    • (2002) Techical Report # 568 , vol.568
    • Frens, J.D.1
  • 13
    • 0030688479 scopus 로고    scopus 로고
    • Auto-blocking matrix-multiplication or tracking BLAS3 performance from source code
    • ACM Press, New York, June
    • J. D. Frens and D. S. Wise. Auto-blocking matrix-multiplication or tracking BLAS3 performance from source code. In Proc. 6th ACM SIGPLAN Symp. on Principles and Practice of Parallel Program., pages 206-216. ACM Press, New York, June 1997. http://doi.acm.org/10.1145/263764.263789
    • (1997) Proc. 6th ACM SIGPLAN Symp. on Principles and Practice of Parallel Program , pp. 206-216
    • Frens, J.D.1    Wise, D.S.2
  • 15
    • 0004236492 scopus 로고    scopus 로고
    • The John Hopkins University Press, Baltimore, third edition
    • G. H. Golub and C. F. Van Loan. Matrix Computations. The John Hopkins University Press, Baltimore, third edition, 1996.
    • (1996) Matrix Computations
    • Golub, G.H.1    Van Loan, C.F.2
  • 21
    • 84958744342 scopus 로고    scopus 로고
    • Recursion unrolling for divide and conquer programs
    • S. Midkiff, J. Moreira, M. Gupta, S. Chatterjee, J. Ferrante, J. Prins, W. Pugh, and C.-W. Tseng, editors. Springer, Berlin
    • R. Rugina and M. Rinard. Recursion unrolling for divide and conquer programs. In S. Midkiff, J. Moreira, M. Gupta, S. Chatterjee, J. Ferrante, J. Prins, W. Pugh, and C.-W. Tseng, editors, Languages and Compilers for Parallel Computing, volume 2017, pages 34-48. Springer, Berlin, 2001. http://link.springer.de/link/service/series/0558/bibs/2017/20170034.htm.
    • (2001) Languages and Compilers for Parallel Computing , vol.2017 , pp. 34-48
    • Rugina, R.1    Rinard, M.2
  • 22
    • 0037997837 scopus 로고
    • R8000 microprocessor chip set
    • Silicon Graphics, Inc. Silicon Graphics, Inc.
    • Silicon Graphics, Inc. R8000 microprocessor chip set. Technical report, Silicon Graphics, Inc., 1994.
    • (1994) Technical Report
  • 24
    • 0037997834 scopus 로고    scopus 로고
    • Undulant block elimination and integer-preserving matrix inversion
    • Jan.
    • D. S. Wise. Undulant block elimination and integer-preserving matrix inversion. Sci. Comp. Program., 33(1):29-85, Jan. 1999. http:// www.cs.indiana.edu/ftp/techreports/TR418.html.
    • (1999) Sci. Comp. Program. , vol.33 , Issue.1 , pp. 29-85
    • Wise, D.S.1
  • 25
    • 84937431996 scopus 로고    scopus 로고
    • Ahnentafel indexing into Morton-ordered arrays, or matrix locality for free
    • A. Bode, T. Ludwig, W. Karl, and R. Wismüller, editors, Euro-Par 2000 - Parallel Processing, Springer, Heidelberg
    • D.S. Wise. Ahnentafel indexing into Morton-ordered arrays, or matrix locality for free. In A. Bode, T. Ludwig, W. Karl, and R. Wismüller, editors, Euro-Par 2000 - Parallel Processing, volume 1900 of Lecture Notes in Computer Science, pages 774-883. Springer, Heidelberg, 2000. http:// link.springer.de/link/service/series/0558/bibs/1900/19000774.htm
    • (2000) Lecture Notes in Computer Science , vol.1900 , pp. 774-883
    • Wise, D.S.1


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