{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:03:58Z","timestamp":1725663838233},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540558958"},{"type":"electronic","value":"9783540473060"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55895-0_424","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:42:17Z","timestamp":1330252937000},"page":"295-306","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Partitioning and mapping for parallel nested dissection on distributed memory architectures"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Charrier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean","family":"Roman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"issue":"3","key":"34_CR1","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/72551.72552","volume":"21","author":"H. E. Bal","year":"1989","unstructured":"H. E. Bal, J. G. Steiner, and A. S. Tanembaum. Programming languages for distributed computing systems. ACM Computing Surveys, 21(3):261\u2013322, 1989.","journal-title":"ACM Computing Surveys"},{"key":"34_CR2","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0167-8191(90)90061-D","volume":"16","author":"M. C. Counilh","year":"1990","unstructured":"M. C. Counilh and J. Roman. Expression for massively parallel algorithms \u2014 description and illustrative example. Parallel Computing, 16:239\u2013251, 1990.","journal-title":"Parallel Computing"},{"issue":"4","key":"34_CR3","first-page":"385","volume":"7","author":"F. Andr\u00e9","year":"1988","unstructured":"F. Andr\u00e9 and J. L. Pazat. Le placement de t\u00e2ches sur des architectures parall\u00e8les. TSI, 7(4):385\u2013401, 1988.","journal-title":"TSI"},{"key":"34_CR4","first-page":"355","volume":"10","author":"T. Muntean","year":"1991","unstructured":"T. Muntean and E. G. Talbi. M\u00e9thodes de placement statique des processus sur architectures parall\u00e8les. TSI, 10:355\u2013374, 1991.","journal-title":"TSI"},{"key":"34_CR5","unstructured":"S. H. Bokhari. Communication overhead on the INTEL iPSC-860 hypercube. Interim Report 10, ICASE, May 1990."},{"key":"34_CR6","unstructured":"S. H. Bokhari. Complete exchange on the INTEL iPSC-860. Technical Report 91\u20134, ICASE, January 1991."},{"key":"34_CR7","unstructured":"J. A. George and J. W. H. Liu. Computer solution of large sparse positive definite systems. Prentice Hall, 1981."},{"issue":"2","key":"34_CR8","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1051\/ita\/1988220202451","volume":"22","author":"P. Charrier","year":"1988","unstructured":"P. Charrier and J. Roman. Etude de la s\u00e9paration et de l'\u00e9limination sur une famille de graphes quotients d\u00e9duite d'une m\u00e9thode de dissections embo\u00eet\u00e9e. RAIRO Informatique th\u00e9orique et Application, 22(2):245\u2013265, 1988.","journal-title":"RAIRO Informatique th\u00e9orique et Application"},{"key":"34_CR9","unstructured":"P. Charrier and J. Roman. Study of the parallelism induced by a nested dissection method and of its implementation on a message passing multiprocessor computer. Rapport interne I-8722, Universit\u00e9 Bordeaux 1, July 1987."},{"key":"34_CR10","unstructured":"P. Charrier and J. Roman. Parallel implementation of block cholesky method in the programming environment of the distributed memory multiprocessor CHEOPS. In Proceedings of the fifth International Symposium on Numerical Methods in Engineering, Vol. 2. Springer-Verlag, 1989."},{"key":"34_CR11","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF01396660","volume":"50","author":"J. R. Gilbert","year":"1987","unstructured":"J. R. Gilbert and R. E. Tarjan. The analysis of a nested dissection algorithm. Numerische Mathematik, 50:377\u2013404, 1987.","journal-title":"Numerische Mathematik"},{"key":"34_CR12","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF01389708","volume":"47","author":"J. Roman","year":"1985","unstructured":"J. Roman. Calcul de complexit\u00e9 relatifs \u00e0 une m\u00e9thode de dissection embo\u00eet\u00e9e. Numerische Mathematik, 47:175\u2013190, 1985.","journal-title":"Numerische Mathematik"},{"key":"34_CR13","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1145\/76909.76910","volume":"15","author":"C. Ashcraft","year":"1989","unstructured":"C. Ashcraft and R. Grimes. The influence of relaxed supernode partitions on the multifrontal method. ACM Trans. on Math. Software, 15:291\u2013309, 1989.","journal-title":"ACM Trans. on Math. Software"},{"issue":"4","key":"34_CR14","first-page":"10","volume":"1","author":"C. Ashcraft","year":"1987","unstructured":"C. Ashcraft, R. Grimes, J. Lewis, B. Peyton, and H. Simon. Progress in sparse matrix methods for large linear systems on vector supercomputers. Intern. J. Supercomp. Appl., 1(4):10\u201329, 1987.","journal-title":"Intern. J. Supercomp. Appl."},{"key":"34_CR15","unstructured":"J. W. H. Liu, E. Ng, and B. W. Peyton. On finding supernodes for sparse matrix computation. Technical report ORNL\/TM-11563, Oak Ridge National Laboratory, 1990."},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"E. Ng. Supernodal symbolic Cholesky factorization on a local-memory multiprocessor. Technical report ORNL\/TM-11836, Oak Ridge National Laboratory, 1991.","DOI":"10.2172\/5896533"},{"key":"34_CR17","unstructured":"P. Charrier, S. Chaumette, M.C. Counilh, J. Roman, and B. Vauquelin. A programming environment for distributed memory computers \u2014 application to scientific computing. In Proceedings of the 13th world congress on computation and applied mathematics \u2014 IMACS'91, Vol. 3, 1991."},{"key":"34_CR18","doi-asserted-by":"crossref","unstructured":"P. Charrier and J. Roman. Partitioning and mapping for parallel nested dissection on distributed memory architectures. Rapport interne I\u20139212, Universit\u00e9 Bordeaux 1, March 1992.","DOI":"10.1007\/3-540-55895-0_424"},{"key":"34_CR19","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF01396049","volume":"55","author":"P. Charrier","year":"1989","unstructured":"P. Charrier and J. Roman. Algorithmique et calculs de complexit\u00e9 pour un solveur de type dissections embo\u00eet\u00e9e. Numerische Mathematik, 55:463\u2013476, 1989.","journal-title":"Numerische Mathematik"},{"key":"34_CR20","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1137\/0611010","volume":"11","author":"J. W. H. H. Liu","year":"1990","unstructured":"J. W. H. Liu. The role of elimination trees in sparse factorization. Siam J. Matrix Anal. Appl., 11:134\u2013172, 1990.","journal-title":"Siam J. Matrix Anal. Appl."},{"key":"34_CR21","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1145\/356004.356006","volume":"8","author":"R. Schreiber","year":"1982","unstructured":"R. Schreiber. A new implementation of sparse Gaussian elimination. ACM Trans. Math. Software, 8:256\u2013276, 1982.","journal-title":"ACM Trans. Math. Software"},{"key":"34_CR22","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0167-8191(88)90039-7","volume":"7","author":"E. Zmijewski","year":"1988","unstructured":"E. Zmijewski and J. R. Gilbert. A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor. Parallel Computing, 7:199\u2013210, 1988.","journal-title":"Parallel Computing"},{"key":"34_CR23","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R. J. Lipton","year":"1979","unstructured":"R. J. Lipton and R. E. Tarjan. A separator theorem for planar graphs. Siam J. Appl. Math., 36:177\u2013189, 1979.","journal-title":"Siam J. Appl. Math."},{"key":"34_CR24","doi-asserted-by":"crossref","unstructured":"G. L. Miller and W. Thurston. Separators in two and three dimensions. In Proceedings of the 22th Annual Symposium on Theory of Computing. ACM, 1990.","DOI":"10.1145\/100216.100255"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing: CONPAR 92\u2014VAPP V"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55895-0_424","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T14:41:17Z","timestamp":1713624077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55895-0_424"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540558958","9783540473060"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-55895-0_424","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]},"assertion":[{"value":"29 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}