{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T03:53:51Z","timestamp":1649217231885},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,3,4]],"date-time":"2008-03-04T00:00:00Z","timestamp":1204588800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1007\/s11227-008-0188-y","type":"journal-article","created":{"date-parts":[[2008,3,3]],"date-time":"2008-03-03T19:03:55Z","timestamp":1204571035000},"page":"84-104","source":"Crossref","is-referenced-by-count":1,"title":["Hypermatrix oriented supernode amalgamation"],"prefix":"10.1007","volume":"46","author":[{"given":"Jos\u00e9 R.","family":"Herrero","sequence":"first","affiliation":[]},{"given":"Juan J.","family":"Navarro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,3,4]]},"reference":[{"key":"188_CR1","volume-title":"Matrix computations","author":"GH Golub","year":"1989","unstructured":"Golub GH, Van Loan CF (1989) Matrix computations, 2nd edn. Johns Hopkins University Press, Baltimore","edition":"2"},{"key":"188_CR2","series-title":"Lecture notes in math","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BFb0093150","volume-title":"Numerical analysis","author":"IS Duff","year":"1982","unstructured":"Duff IS (1982) Full matrix techniques in sparse Gaussian elimination. In: Numerical analysis, Dundee, 1981. Lecture notes in math, vol 912. Springer, Berlin, pp 71\u201384"},{"issue":"5","key":"188_CR3","doi-asserted-by":"crossref","first-page":"1034","DOI":"10.1137\/0914063","volume":"14","author":"EG Ng","year":"1993","unstructured":"Ng EG, Peyton BW (1993) Block sparse Cholesky algorithms on advanced uniprocessor computers. SIAM J Sci Comput 14(5):1034\u20131056","journal-title":"SIAM J Sci Comput"},{"issue":"6","key":"188_CR4","doi-asserted-by":"crossref","first-page":"1413","DOI":"10.1137\/0915085","volume":"15","author":"E Rothberg","year":"1994","unstructured":"Rothberg E, Gupta A (1994) An efficient block-oriented approach to parallel sparse Cholesky factorization. SIAM J Sci Comput 15(6):1413\u20131439","journal-title":"SIAM J Sci Comput"},{"issue":"3","key":"188_CR5","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1137\/S106482759426715X","volume":"17","author":"E Rothberg","year":"1996","unstructured":"Rothberg E (1996) Performance of panel and block approaches to sparse Cholesky factorization on the iPSC\/860 and Paragon multicomputers. SIAM J Sci Comput 17(3):699\u2013713","journal-title":"SIAM J Sci Comput"},{"key":"188_CR6","unstructured":"Gupta A, Joshi M, Kumar V (2001) WSMP: A high-performance shared- and distributed-memory parallel sparse linear equation solver. Technical Report, IBM Research Division, TJ Watson Research Center, April 2001"},{"key":"188_CR7","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/3-540-46080-2_35","volume-title":"ICCS\u201902","author":"D Irony","year":"2002","unstructured":"Irony D, Shklarski G, Toledo S (2002) Parallel and fully recursive multifrontal sparse Cholesky. In: ICCS\u201902. Lecture notes in computer science, vol 2330. Springer, Berlin, pp 335\u2013344"},{"key":"188_CR8","doi-asserted-by":"crossref","unstructured":"Gould NIM, Scott JA, Hu Y (2007) A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations. ACM Trans Math Softw 33(2), Article 10, 32 pages","DOI":"10.1145\/1236463.1236465"},{"issue":"1","key":"188_CR9","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1137\/0614019","volume":"14","author":"JW Liu","year":"1993","unstructured":"Liu JW, Ng EG, Peyton BW (1993) On finding supernodes for sparse matrix computations. SIAM J Matrix Anal Appl 14(1):242\u2013252","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"3","key":"188_CR10","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1145\/356044.356047","volume":"9","author":"IS Duff","year":"1983","unstructured":"Duff IS, Reid JK (1983) The multifrontal solution of indefinite sparse symmetric linear systems. ACM Trans Math Softw 9(3):302\u2013325","journal-title":"ACM Trans Math Softw"},{"key":"188_CR11","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1145\/76909.76910","volume":"15","author":"C Ashcraft","year":"1989","unstructured":"Ashcraft C, Grimes RG (1989) The influence of relaxed supernode partitions on the multifrontal method. ACM Trans Math Softw 15:291\u2013309","journal-title":"ACM Trans Math Softw"},{"key":"188_CR12","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0045-7825(72)90005-9","volume":"1","author":"G Fuchs Von","year":"1972","unstructured":"Von Fuchs G, Roy JR, Schrem E (1972) Hypermatrix solution of large sets of symmetric positive-definite linear equations. Comput Meth Appl Mech Eng 1:197\u2013216","journal-title":"Comput Meth Appl Mech Eng"},{"key":"188_CR13","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0045-7949(75)90034-6","volume":"5","author":"A Noor","year":"1975","unstructured":"Noor A, Voigt S (1975) Hypermatrix scheme for the STAR\u2013100 computer. Comput Struct 5:287\u2013296","journal-title":"Comput Struct"},{"key":"188_CR14","unstructured":"Ast M, Fischer R, Manz H, Schulz U (1997) PERMAS: User\u2019s reference manual. INTES publication no 450, rev.d"},{"issue":"3","key":"188_CR15","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s00200-007-0039-8","volume":"18","author":"JR Herrero","year":"2007","unstructured":"Herrero JR, Navarro JJ (2007) Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking. Appl Algebra Eng Commun Comput 18(3):279\u2013295. doi: 10.1007\/s00200-007-0039-8","journal-title":"Appl Algebra Eng Commun Comput"},{"issue":"1","key":"188_CR16","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1137\/0611010","volume":"11","author":"JHW Liu","year":"1990","unstructured":"Liu JHW (1990) The role of elimination trees in sparse factorization. SIAM J Matrix Anal Appl 11(1):134\u2013172","journal-title":"SIAM J Matrix Anal Appl"},{"key":"188_CR17","doi-asserted-by":"crossref","unstructured":"Ast M, Barrado C, Cela JM, Fischer R, Laborda O, Manz H, Schulz U (2000) Sparse matrix structure for dynamic parallelisation efficiency. In: Euro-Par 2000. Lecture notes in computer science, vol 1900, pp 519\u2013526","DOI":"10.1007\/3-540-44520-X_69"},{"key":"188_CR18","unstructured":"Herrero JR, Navarro JJ (2003) Automatic benchmarking and optimization of codes: an experience with numerical kernels. In: Int conf on software engineering research and practice. CSREA Press, pp 701\u2013706"},{"key":"188_CR19","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/978-3-540-45209-6_68","volume-title":"Euro-Par\u201903","author":"JR Herrero","year":"2003","unstructured":"Herrero JR, Navarro JJ (2003) Improving performance of hypermatrix Cholesky factorization. In: Euro-Par\u201903. Lecture notes in computer science, vol 2790. Springer, Berlin, pp 461\u2013469"},{"key":"188_CR20","first-page":"143","volume-title":"IFIP TC5 workshop on high performance computational science and engineering (HPCSE), world computer congress","author":"JR Herrero","year":"2004","unstructured":"Herrero JR, Navarro JJ (2004) Reducing overhead in sparse hypermatrix Cholesky factorization. In: IFIP TC5 workshop on high performance computational science and engineering (HPCSE), world computer congress. Springer, Berlin, pp 143\u2013154"},{"key":"188_CR21","unstructured":"Herrero JR, Navarro JJ (2005) Intra-block amalgamation in sparse hypermatrix Cholesky factorization. In: Int conf on computational science and engineering, pp 15\u201322"},{"key":"188_CR22","unstructured":"NetLib. Linear programming problems"},{"key":"188_CR23","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1287\/opre.38.2.240","volume":"38","author":"WJ Carolan","year":"1990","unstructured":"Carolan WJ, Hill JE, Kennington JL, Niemi S, Wichmann SJ (1990) An empirical evaluation of the KORBX algorithms for military airlift applications. Oper Res 38:240\u2013248","journal-title":"Oper Res"},{"key":"188_CR24","unstructured":"Frangioni A Multicommodity min cost flow problems. Operations research group, Department of Computer Science, University of Pisa"},{"key":"188_CR25","unstructured":"Badics T (1991) RMFGEN generator"},{"key":"188_CR26","unstructured":"Lee Y, Orlin J (1991) GRIDGEN generator"},{"key":"188_CR27","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/3-540-69346-7_26","volume-title":"Proceedings of the 6th international conference on integer programming and combinatorial optimization, IPCO\u201998","author":"AV Goldberg","year":"1998","unstructured":"Goldberg AV, Oldham JD, Plotkin S, Stein C (1998) An implementation of a combinatorial approximation algorithm for minimum-cost multicommodity flow. In: Proceedings of the 6th international conference on integer programming and combinatorial optimization, IPCO\u201998, Houston, Texas, June 22\u201324, 1998. Lecture notes in computer science, vol 1412. Springer, Berlin, pp 338\u2013352"},{"issue":"1","key":"188_CR28","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1999","unstructured":"Karypis G, Kumar V (1999) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20(1):359\u2013392","journal-title":"SIAM J Sci Comput"},{"issue":"10","key":"188_CR29","doi-asserted-by":"crossref","first-page":"1202","DOI":"10.1145\/63039.63043","volume":"31","author":"JE Smith","year":"1988","unstructured":"Smith JE (1988) Characterizing computer performance with a single number. Commun ACM, CACM 31(10):1202\u20131207","journal-title":"Commun ACM, CACM"},{"key":"188_CR30","first-page":"24","volume-title":"Proceedings of the 22nd annual international symposium on computer architecture","author":"SC Woo","year":"1995","unstructured":"Woo SC, Ohara M, Torrie E, Singh JP, Gupta A (1995) The SPLASH-2 programs: characterization and methodological considerations. In: Proceedings of the 22nd annual international symposium on computer architecture. ACM, New York, pp 24\u201336"},{"key":"188_CR31","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1137\/1034004","volume":"34","author":"JW-H Liu","year":"1992","unstructured":"Liu JW-H (1992) The multifrontal method for sparse matrix solution: Theory and practice. SIAM Rev 34:82\u2013109","journal-title":"SIAM Rev"},{"key":"188_CR32","series-title":"Lecture notes in computer science","first-page":"580","volume-title":"PARA\u201906","author":"JR Herrero","year":"2006","unstructured":"Herrero JR, Navarro JJ (2006) Using non-canonical array layouts in dense matrix operations. In: PARA\u201906. Lecture notes in computer science, vol 4699. Springer, Berlin, pp 580\u2013588"},{"issue":"1\u20132","key":"188_CR33","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1147\/rd.411.0171","volume":"41","author":"A Gupta","year":"1997","unstructured":"Gupta A (1997) Fast and effective algorithms for graph partitioning and sparse-matrix ordering. IBM J Res Dev 41(1\u20132):171\u2013183","journal-title":"IBM J Res Dev"},{"key":"188_CR34","unstructured":"Gupta A (1996) Graph partitioning based sparse matrix orderings for interior point algorithms. Technical Report RC 20467(90480), IBM Research Division"},{"issue":"1","key":"188_CR35","first-page":"6","volume":"36","author":"JR Herrero","year":"2007","unstructured":"Herrero JR, Navarro JJ (2007) Sparse hypermatrix Cholesky: Customization for high performance. IAENG Int J Appl Math 36(1):6\u201312","journal-title":"IAENG Int J Appl Math"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-008-0188-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-008-0188-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-008-0188-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:23:56Z","timestamp":1559384636000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-008-0188-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,4]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["188"],"URL":"https:\/\/doi.org\/10.1007\/s11227-008-0188-y","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3,4]]}}}