{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:18:21Z","timestamp":1742383101493},"reference-count":0,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Scientific Programming"],"published-print":{"date-parts":[[2002,1]]},"abstract":"<jats:p>A suite of scalable atomistic simulation programs has been developed for materials research based on space\u2010time multiresolution algorithms. Design and analysis of parallel algorithms are presented for molecular dynamics (MD) simulations and quantum\u2010mechanical (QM) calculations based on the density functional theory. Performance tests have been carried out on 1,088\u2010processor Cray T3E and 1,280\u2010processor IBM SP3 computers. The linear\u2010scaling algorithms have enabled 6.44\u2010billion\u2010atom MD and 111,000\u2010atom QM calculations on 1,024 SP3 processors with parallel efficiency well over 90%. production\u2010quality programs also feature wavelet\u2010based computational\u2010space decomposition for adaptive load balancing, spacefilling\u2010curve\u2010based adaptive data compression with user\u2010defined error bound for scalable I\/O, and octree\u2010based fast visibility culling for immersive and interactive visualization of massive simulation data.<\/jats:p>","DOI":"10.1155\/2002\/203525","type":"journal-article","created":{"date-parts":[[2015,1,12]],"date-time":"2015-01-12T13:59:11Z","timestamp":1421071151000},"page":"263-270","source":"Crossref","is-referenced-by-count":19,"title":["Scalable Atomistic Simulation Algorithms for Materials Research"],"prefix":"10.1155","volume":"10","author":[{"given":"Aiichiro","family":"Nakano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajiv K.","family":"Kalia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Priya","family":"Vashishta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timothy J.","family":"Campbell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuji","family":"Ogata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fuyuki","family":"Shimojo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subhash","family":"Saini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2002,11,26]]},"container-title":["Scientific Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2002\/203525.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2002\/203525","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T10:20:13Z","timestamp":1723112413000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2002\/203525"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["10.1155\/2002\/203525"],"URL":"https:\/\/doi.org\/10.1155\/2002\/203525","archive":["Portico"],"relation":{},"ISSN":["1058-9244","1875-919X"],"issn-type":[{"type":"print","value":"1058-9244"},{"type":"electronic","value":"1875-919X"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}