{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:11:26Z","timestamp":1725469886284},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540377832"},{"type":"electronic","value":"9783540377849"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11823285_73","type":"book-chapter","created":{"date-parts":[[2006,9,5]],"date-time":"2006-09-05T14:04:04Z","timestamp":1157465044000},"page":"700-709","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Parallel Fault Tolerant Algorithms for Parabolic Problems"],"prefix":"10.1007","author":[{"given":"Hatem","family":"Ltaief","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Garbey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edgar","family":"Gabriel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"73_CR1","unstructured":"MPI Forum : MPI: A Message-Passing Interface Standard. Document for a Standard Message-Passing Interface, University of Tennessee, 1993 (1994)"},{"key":"73_CR2","doi-asserted-by":"crossref","unstructured":"Sankaran, S., Squyres, J.M., Barrett, B., Lumsdaine, A., Duell, J., Hargrove, P., Roman, E.: The LAM\/MPI Checkpoint\/Restart Framework: System-Initiated Checkpointing. International Journal of High Performance Computing Applications (2004)","DOI":"10.1177\/1094342005056139"},{"key":"73_CR3","doi-asserted-by":"crossref","unstructured":"Bosilca, G., Bouteiller, A., Cappello, F., Djilali, S., Fedak, G., Germain, C., Herault, T., Lemarinier, P., Lodygensky, O., Magniette, F., Neri, V., Selikhov, A.: MPICH-V: Toward a Scalable Fault Tolerant MPI for Volatile Nodes. In: SC 2002 Conference CD, IEEE\/ACM SIGARCH, Baltimore, MD (2002)","DOI":"10.1109\/SC.2002.10048"},{"issue":"4","key":"73_CR4","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1177\/1094342005056137","volume":"19","author":"G.E. Fagg","year":"2005","unstructured":"Fagg, G.E., Gabriel, E., Chen, Z., Angskun, T., Bosilca, G., Pjesivac-Grbovic, J., Dongarra, J.J.: Process Fault-Tolerance: Semantics, Design and Applications for High Performance Computing. International Journal of High Performance Computing Applications\u00a019(4), 465\u2013477 (2005)","journal-title":"International Journal of High Performance Computing Applications"},{"key":"73_CR5","doi-asserted-by":"crossref","unstructured":"Beck, Dongarra, Fagg, Geist, Gray, Kohl, Migliardi, Moore, K., Moore, T., Papadopoulous, Scott, Sunderam: HARNESS: a next generation distributed virtual machine, Future Generation Computer Systems, 15 (1999)","DOI":"10.1016\/S0167-739X(99)00010-2"},{"key":"73_CR6","doi-asserted-by":"crossref","unstructured":"Engelmann, C., Geist, G.A.: Super-Scalable Algorithms for Computing on 100,000 Processors. In: Proceedings of International Conference on Computational Science (ICCS) 2005, Atlanta, GA, USA (May 2005)","DOI":"10.1007\/11428831_39"},{"key":"73_CR7","volume-title":"Proceedings of the 2005 ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2005)","author":"Z. Chen","year":"2005","unstructured":"Chen, Z., Fagg, G.E., Gabriel, E., Langou, J., Angskun, T., Bosilca, G., Dongarra, J.J.: Fault Tolerant High Performance Computing by a coding approach. In: Proceedings of the 2005 ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2005), Chicago, IL, June 15-17, 2005, ACM Press, New York (2005)"},{"key":"73_CR8","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033210","volume-title":"The Mollification Method and the Numerical Solution of Ill-posed Problems","author":"D.A. Murio","year":"1993","unstructured":"Murio, D.A.: The Mollification Method and the Numerical Solution of Ill-posed Problems. Wiley, New York (1993)"},{"key":"73_CR9","unstructured":"Garbey, M., Ltaief, H.: Fault Tolerant Domain Decomposition for Parabolic Problems Domain Decomposition 16, New York University, January 2005 (to appear, 2005)"},{"issue":"4","key":"73_CR10","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1137\/0521048","volume":"21","author":"W. Eckhaus","year":"1990","unstructured":"Eckhaus, W., Garbey, M.: Asymptotic analysis on large time scales for singular perturbation problems of hyperbolic type. SIAM J. Math. Anal.\u00a021(4), 867\u2013883 (1990)","journal-title":"SIAM J. Math. Anal."},{"key":"73_CR11","doi-asserted-by":"crossref","unstructured":"Dupros, M.: A Filtering technique for System of Reaction Diffusion equations. Int. J. for Numerical Methods in Fluids (in press, 2006)","DOI":"10.1002\/fld.1082"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2006 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11823285_73","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T20:20:31Z","timestamp":1587327631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11823285_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540377832","9783540377849"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11823285_73","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}