{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T08:56:17Z","timestamp":1754556977897},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679561"},{"type":"electronic","value":"9783540445203"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"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":[[2000]]},"DOI":"10.1007\/3-540-44520-x_69","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T03:51:43Z","timestamp":1188359503000},"page":"519-526","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Sparse Matrix Structure for Dynamic Parallelisation Efficiency"],"prefix":"10.1007","author":[{"given":"Markus","family":"Ast","sequence":"first","affiliation":[]},{"given":"Cristina","family":"Barrado","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9","family":"Cela","sequence":"additional","affiliation":[]},{"given":"Rolf","family":"Fischer","sequence":"additional","affiliation":[]},{"given":"Jes\u00fas","family":"Labarta","sequence":"additional","affiliation":[]},{"given":"\u00d3scar","family":"Laborda","sequence":"additional","affiliation":[]},{"given":"Hartmut","family":"Manz","sequence":"additional","affiliation":[]},{"given":"Uwe","family":"Schulz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,8,18]]},"reference":[{"key":"69_CR1","unstructured":"Abaqus product performance. \n                    http:\/\/www.abaqus.com\/products\/p_performace58.htm"},{"key":"69_CR2","unstructured":"M. Ast, R. Fischer, J. Labarta and H. Manz. \u201cRun-Time Parallelization of Large FEM Analyses with PERMAS\u201d. NASA\u201997 National Symposium. 1997."},{"key":"69_CR3","unstructured":"T. Bui and C. Jones \u201cA heuristic for reducing fill in sparse matrix factorization\u201d. 6th SIAM Conf. Parallel Processing for Scientific Computing, pp. 445\u2013452, 1993."},{"key":"69_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1006\/jpdc.1998.1437","volume":"50","author":"S. Fink","year":"1998","unstructured":"S. Fink, S. Baden and S. Kohn. \u201cEfficient Run-Time Support for Irregular Block-Structured Applications\u201d. Journal of Parallel and Distributed Computing 50, pp. 61\u201382. 1998.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"69_CR5","doi-asserted-by":"crossref","unstructured":"T. Johnson. \u201cA concurrent Dynamic Task Graph\u201d. International Conference on Parallel Processing, 1993.","DOI":"10.1109\/ICPP.1993.18"},{"key":"69_CR6","unstructured":"G. Karypis and V. Kumar. \u201cA fast and highly quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing. 1995."},{"key":"69_CR7","unstructured":"L. Komzsik, \u201cParallel Processing in MSC\/Nastran\u2019. 1993 MSC World Users Conference, Virginia, 1993. \n                    http:\/\/www.macsch.com"},{"key":"69_CR8","unstructured":"V. Kumar et al. \u201cIntroduction to parallel Computing. Design and analysis of algorithms. The Benjamin\/Cumminngs Pub. 1994."},{"key":"69_CR9","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0167-8191(86)90014-1","volume":"3","author":"J. Liu","year":"1986","unstructured":"J. Liu. \u201cComputational models and task scheduling for parallel sparse Cholesky factorization\u201d. Parallel Computing 3, pp. 327\u2013342, 1986.","journal-title":"Parallel Computing"},{"key":"69_CR10","unstructured":"Marc product description. \n                    http:\/\/www.marc.com\/Product\/MARC"},{"key":"69_CR11","doi-asserted-by":"crossref","unstructured":"R. Schreiber. \u201cScalability of sparse direct solvers\u201d. Graph theory and sparse matrix computations, The IMA volumes in mathematics and its applications, vol. 56, pp. 191\u2013209, 1993.","DOI":"10.1007\/978-1-4613-8369-7_9"},{"key":"69_CR12","doi-asserted-by":"crossref","unstructured":"S. Venugopal, V. Naik. \u201cEffects of partitioning and scheduling sparse matrix factorization on communications and load balance\u201d. Supercomputing\u201991, pp. 866\u2013875, 1991.","DOI":"10.1145\/125826.126716"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2000 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44520-X_69","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:04:15Z","timestamp":1587341055000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44520-X_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679561","9783540445203"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-44520-x_69","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"18 August 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}