{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T05:35:22Z","timestamp":1741066522691,"version":"3.38.0"},"reference-count":40,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"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 Supercomputer Applications and High Performance Computing"],"published-print":{"date-parts":[[1996,3]]},"abstract":"<jats:p> The O( N) hierarchical N-body algorithms and mas sively parallel processors allow particle systems of 100 million particles or more to be simulated in acceptable time. We describe a data-parallel implementation of Anderson's method and demonstrate both efficiency and scalability of the implementation on the Connec tion Machine CM-5\/5E systems. The communication time for large particle systems amounts to about 10%- 25%, and the overall efficiency is about 35%, corre sponding to a performance of about 60 Mflop\/s per CM-5E node, independent of the number of nodes. <\/jats:p>","DOI":"10.1177\/109434209601000101","type":"journal-article","created":{"date-parts":[[2007,3,5]],"date-time":"2007-03-05T01:17:47Z","timestamp":1173057467000},"page":"3-40","source":"Crossref","is-referenced-by-count":2,"title":["A Data-Parallel Implementation of Hierarchical N-Body Methods"],"prefix":"10.1177","volume":"10","author":[{"family":"Yu Hu","sequence":"first","affiliation":[{"name":"AIKEN COMPUTATION LABORATORY HARVARD UNIVERSITY CAMBRIDGE,\rMASSACHUSETTS 02138"}]},{"given":"S. Lennart","family":"Johnsson","sequence":"additional","affiliation":[{"name":"UNIVERSITY OF HOUSTON HOUSTON, TEXAS 77204-3475 AND\rAIKEN COMPUTATION LABORATORY HARVARD UNIVERSITY CAMBRIDGE, MASSACHUSETTS 02138"}]}],"member":"179","published-online":{"date-parts":[[1996,3,1]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1137\/0913055"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1137\/0906008"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1985.1676638"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1038\/324446a0"},{"volume-title":"Proc. Scalable High Performance Computing Conference SHPCC94","author":"Board Jr.,J.A.","key":"atypb5"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1137\/0909044"},{"volume-title":"A set of level 3 basic linear algebra subprograms. Technical Report reprint no. 1","year":"1988","author":"Dongarra, J.J.","key":"atypb7"},{"volume-title":"An extended set of Fortran basic linear algebra subprograms. Technical Memorandum 41","year":"1986","author":"Dongarra, J.J.","key":"atypb8"},{"volume-title":"Fast Fourier transform accelerated fast multipole algorithm. Technical Report 94-001","year":"1994","author":"Elliott, W.D.","key":"atypb9"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90043-U"},{"volume-title":"A comparison of algorithms for long range interactions","year":"1994","author":"Esselink, K.","key":"atypb11"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/5750.001.0001"},{"key":"atypb13","doi-asserted-by":"crossref","unstructured":"Greengard, L., and Gropp, W.D. 1989. A parallel version of the fast multipole method . In Parallel processing for scientific computing. Philadelphia: Society for Industrial and Applied Mathematics , pp. 213-222.","DOI":"10.21236\/ADA199804"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1016\/0021-9991(87)90140-9"},{"volume-title":"Rapid evaluation of potential fields in three dimensions. Technical Report YALEU\/DCS\/RR-515","year":"1987","author":"Greengard, L.","key":"atypb15"},{"volume-title":"On the efficient implementation of the fast multipole method. Technical Report YALEU\/DCS\/RR-602","year":"1988","author":"Greengard, L.","key":"atypb16"},{"volume-title":"Computer architecture: a quantitative approach","year":"1990","author":"Hennessy, J.L.","key":"atypb17"},{"issue":"1","key":"atypb18","first-page":"1","volume":"2","author":"High Performance Fortran Forum.","year":"1993","journal-title":"Scientific Programming"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1109\/12.29465"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1137\/0910048"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1145\/355841.355847"},{"volume-title":"The parallel fast multipole method in three dimensions. Ph.D. thesis","year":"1992","author":"Leathrum, J.F.","key":"atypb22"},{"volume-title":"The parallel fast multipole algorithm in three dimensions. Technical Report CSL-TR-92-506","year":"1992","author":"Leathrum Jr.J.F.","key":"atypb23"},{"volume-title":"The parallel implementation of N-body algorithms. Ph.D. thesis","year":"1994","author":"Liu, P.","key":"atypb24"},{"volume-title":"In Proceedings of the 6th annual ACM symposium on parallel algorithms and architecture","author":"Liu, P.","key":"atypb25"},{"volume-title":"50 GFlops molecular dynamics on the Connection Machine 5. In Proceedings of Supercomputing '93","year":"1993","author":"Lomdahl, P.S.","key":"atypb26"},{"key":"atypb27","first-page":"361","volume":"17","author":"McLaren, A.D.","year":"1963","journal-title":"Computing"},{"volume-title":"A data-parallel implementation of the adaptive fast multipole algorithm. In Proceedings of the DAGS '93 Symposium","year":"1993","author":"Nyland, L.S.","key":"atypb28"},{"volume-title":"Parallel hierarchical N-body methods. Ph.D. thesis","year":"1990","author":"Salmon, J.K.","key":"atypb29"},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.1007\/BF01030008"},{"key":"atypb31","doi-asserted-by":"crossref","unstructured":"Singh, J., Holt, C., Hennessey, J., and Gupta, A. 1993. A parallel adaptive fast multipole method. In Proceedings of Supercomputing '93. Los Alamitos: IEEE Computer Society, pp. 54-65.","DOI":"10.1145\/169627.169651"},{"volume-title":"Load balancing and data locality in hierarchical N-body methods. Technical Report CSL-TR-92-505","year":"1992","author":"Singh, J.","key":"atypb32"},{"volume-title":"CM-5 technical summary","year":"1992","author":"Thinking Machines Corp.","key":"atypb33"},{"volume-title":"CM Fortran reference manual, version 2.1","year":"1993","author":"Thinking Machines Corp.","key":"atypb34"},{"volume-title":"CMSSL for CM Fortran, version 3.1","year":"1993","author":"Thinking Machines Corp.","key":"atypb35"},{"key":"atypb36","doi-asserted-by":"crossref","unstructured":"Warren, M., and Salmon, J. 1992. Astrophysical N-body simulations using hierarchical tree data structures. In Proceedings of Supercomputing '92. Los Alamitos: IEEE Computer Society, pp. 570-576.","DOI":"10.1109\/SUPERC.1992.236647"},{"key":"atypb37","doi-asserted-by":"crossref","unstructured":"Warren, M., and Salmon, J. 1993. A parallel hashed oct-tree N-body algorithm. In Proceedings of Supercomputing '93. Los Alamitos: IEEE Computer Society, pp. 12-21.","DOI":"10.1145\/169627.169640"},{"key":"atypb38","doi-asserted-by":"publisher","DOI":"10.1016\/0010-4655(94)00177-4"},{"volume-title":"An O(N) algorithm for three-dimensional N-body simulations. AI Memo 995","year":"1987","author":"Zhao, F.","key":"atypb39"},{"key":"atypb40","doi-asserted-by":"publisher","DOI":"10.1137\/0912077"}],"container-title":["The International Journal of Supercomputer Applications and High Performance Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/109434209601000101","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/109434209601000101","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,3]],"date-time":"2025-03-03T11:05:35Z","timestamp":1740999935000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/109434209601000101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["10.1177\/109434209601000101"],"URL":"https:\/\/doi.org\/10.1177\/109434209601000101","relation":{},"ISSN":["1078-3482"],"issn-type":[{"type":"print","value":"1078-3482"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}