{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T17:53:22Z","timestamp":1773251602891,"version":"3.50.1"},"reference-count":17,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2000,11,1]],"date-time":"2000-11-01T00:00:00Z","timestamp":973036800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The International Journal of High Performance Computing Applications"],"published-print":{"date-parts":[[2000,11]]},"abstract":"<jats:p> The authors develop a model for the parallel performance of algorithms that consist of concurrent, two-dimensional wavefronts implemented in a message-passing environment. The model, based on a LogGP machine parameterization, combines the separate contributions of computation and communication wavefronts. The authors validate the model on three important supercomputer systems, on up to 500 processors. They use data from a deterministic particle transport application taken from the ASCI workload, although the model is general to any wavefront algorithm implemented on a 2-D processor domain. They also use the validated model to make estimates of performance and scalability of wavefront algorithms on 100 TFLOPS computer systems expected to be in existence within the next decade as part of the ASCI program and elsewhere. In this context, the authors analyze two problem sizes. Their model shows that on the largest such problem (1 billion cells), interprocessor communication performance is not the bottleneck. Single-node efficiency is the dominant factor. <\/jats:p>","DOI":"10.1177\/109434200001400405","type":"journal-article","created":{"date-parts":[[2005,3,8]],"date-time":"2005-03-08T19:23:01Z","timestamp":1110309781000},"page":"330-346","source":"Crossref","is-referenced-by-count":110,"title":["Performance and Scalability Analysis of Teraflop-Scale Parallel Architectures                 Using Multidimensional Wavefront Applications"],"prefix":"10.1177","volume":"14","author":[{"given":"Adolfy","family":"Hoisie","sequence":"first","affiliation":[{"name":"Scientific Computing Group, Los Alamos National Laboratory, Los Alamos,\r                        New Mexico"}]},{"given":"Olaf","family":"Lubeck","sequence":"additional","affiliation":[{"name":"Scientific Computing Group, Los Alamos National Laboratory, Los Alamos,\r                        New Mexico"}]},{"given":"Harvey","family":"Wasserman","sequence":"additional","affiliation":[{"name":"Scientific Computing Group, Los Alamos National Laboratory, Los Alamos,\r                        New Mexico"}]}],"member":"179","published-online":{"date-parts":[[2000,11,1]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.13182\/NSE77-1"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.2172\/212580"},{"key":"atypb3","first-page":"377","volume-title":"Proc. of the Joint International Conference on Mathematical Methods and Supercomputing for Nuclear Applications","author":"Baker, R. S."},{"key":"atypb4","volume-title":"Implementation of the first-order form of the 3-D discrete ordinates equations on a T3D","author":"Baker, R. S.","year":"1995"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.13182\/NSE98-1"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1145\/240455.240477"},{"key":"atypb7","volume-title":"International conference on mathematics and computations, reactor physics, and environmental analyses","author":"Dorr, M. R."},{"key":"atypb8","volume-title":"Concurrent source iteration in the solution of three-dimensional multigroup discrete ordinates neutron transport equations","author":"Dorr, M. R.","year":"1995"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1137\/0909037"},{"key":"atypb10","volume-title":"Effects of latency, occupancy, and bandwidth in DSM multiprocessors","author":"Holt, C.","year":"1995"},{"key":"atypb11","author":"Joubert, W. D.","journal-title":"SIAM J. Sci. Comp."},{"key":"atypb12","first-page":"198","volume":"65","author":"Koch, K. R.","year":"1992","journal-title":"Trans. of the Amer. Nuc. Soc."},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1145\/360827.360844"},{"key":"atypb14","volume-title":"Computational Methods of Neutron Transport","author":"Lewis, E. E.","year":"1993"},{"key":"atypb15","volume-title":"In Search of Clusters: The Coming Battle in Lowly Parallel Computing","author":"Pfister, G. F.","year":"1995"},{"key":"atypb16","first-page":"405","volume-title":"IEEE Second International Conference on Algorithms & Architectures for Parallel Processing","author":"Qin, J."},{"key":"atypb17","volume-title":"Analysis and optimization of software pipeline performance on MIMD parallel computers","author":"Van der Wijngaart, R. F.","year":"1997"}],"container-title":["The International Journal of High Performance Computing Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/109434200001400405","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/109434200001400405","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,3]],"date-time":"2025-03-03T03:19:07Z","timestamp":1740971947000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/109434200001400405"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,11]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2000,11]]}},"alternative-id":["10.1177\/109434200001400405"],"URL":"https:\/\/doi.org\/10.1177\/109434200001400405","relation":{},"ISSN":["1094-3420","1741-2846"],"issn-type":[{"value":"1094-3420","type":"print"},{"value":"1741-2846","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,11]]}}}