{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:03:40Z","timestamp":1742994220837,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664437"},{"type":"electronic","value":"9783540483113"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","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":[[1999]]},"DOI":"10.1007\/3-540-48311-x_149","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:16:48Z","timestamp":1269897408000},"page":"1068-1072","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Scheduling of Algorithms Based on Elimination Trees on NUMA Systems"],"prefix":"10.1007","author":[{"given":"Mar\u00eda J.","family":"Mart\u00edn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Inmaculada","family":"Pardines","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco F.","family":"Rivera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,8,6]]},"reference":[{"key":"149_CR1","unstructured":"T.A. Davis, P. Amestoy and I.S. Duff, An approximate minimum degree ordering algorithm, Technical report, Computer and Information Sciences Dept., University of Florida, 1995."},{"key":"149_CR2","unstructured":"I.S. Duff, R.G. Grimes, and J.G. Lewis, User\u2019s guide for the harwell-boeing sparse matrix collection, Technical Report TR-PA-92-96, CERFACS, October 1992."},{"key":"149_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0377-0427(89)90364-6","volume":"27","author":"A. George","year":"1989","unstructured":"A. George, M. Heath, J. Liu, E. Ng, Solution of sparse positive definite systems on a hypercube, J. Comput. Appl. Math., 27, 1989, pp. 129\u2013156.","journal-title":"J. Comput. Appl. Math."},{"key":"149_CR4","volume-title":"Practical optimization","author":"P.E. Gill","year":"1981","unstructured":"P.E. Gill, W. Murray and M.H. Wright, Practical optimization, Academic Press, London, 1981."},{"key":"149_CR5","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1137\/0611010","volume":"11","author":"J.W.H. Liu","year":"1990","unstructured":"J.W.H. Liu, The role of elimination trees in sparse factorization, SIAM Journal on Matrix Anal. Appl., 11, 1990, pp. 134\u2013172.","journal-title":"SIAM Journal on Matrix Anal. Appl."},{"key":"149_CR6","unstructured":"Portable Programs for Parallel Processors, Lusk et al, Holt Rinchart and Winston 1987."},{"key":"149_CR7","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"R.C. Prim, Shortest connection networks and some generalizations, Bell System Tech. J., 36, 1957, pp.1389\u20131401.","journal-title":"Bell System Tech. J."},{"key":"149_CR8","unstructured":"Jaswinder Pal Singh, Wolf-Dietrich Weber and Anoop Gupta, SPLASH: Stanford Parallel Applications for Shared-Memory, Technical Report, Stanford University, Computer Systems Laboratory, Number CSL-TR-92-526, June 1992, p. 45."},{"key":"149_CR9","doi-asserted-by":"crossref","unstructured":"S.C. Woo, M. Ohara, E. Torrie, J.P. Singh and A. Gupta, The SPLASH-2 Programs: Characterization and Methodological Considerations, Proceedings of the 22nd Annual International Symposium on Computer Architecture, ACM Press, June 22-24 1995, pp. 24\u201337.","DOI":"10.1145\/223982.223990"}],"container-title":["Lecture Notes in Computer Science","Euro-Par\u201999 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48311-X_149","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,17]],"date-time":"2020-09-17T14:44:42Z","timestamp":1600353882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48311-X_149"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664437","9783540483113"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-48311-x_149","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"6 August 1999","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"}]}}