层次分解:Barnes-Hut树算法的并行实现

Int. J. High Speed Comput. Pub Date : 1996-03-01 DOI:10.1142/S0129053396000021

G. Bhanot, J. Janak, R. Walkup, V. Sonnad

{"title":"层次分解:Barnes-Hut树算法的并行实现","authors":"G. Bhanot, J. Janak, R. Walkup, V. Sonnad","doi":"10.1142/S0129053396000021","DOIUrl":null,"url":null,"abstract":"Given the coordinates of N points in D dimensions, the Barnes-Hut tree algorithm produces an ordered list so that successive pairs in the sequence are nearest neighbors, sets of four form a cluster, sets of eight form a bigger cluster, and so on. We describe a parallel implementation of this algorithm on the IBM SP2 using Fortran 77 and MPI message-passing calls, and study its performance.","PeriodicalId":270006,"journal":{"name":"Int. J. High Speed Comput.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Hierarchical Decomposition: a Parallel Implementation of the Barnes-Hut Tree Algorithm\",\"authors\":\"G. Bhanot, J. Janak, R. Walkup, V. Sonnad\",\"doi\":\"10.1142/S0129053396000021\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Given the coordinates of N points in D dimensions, the Barnes-Hut tree algorithm produces an ordered list so that successive pairs in the sequence are nearest neighbors, sets of four form a cluster, sets of eight form a bigger cluster, and so on. We describe a parallel implementation of this algorithm on the IBM SP2 using Fortran 77 and MPI message-passing calls, and study its performance.\",\"PeriodicalId\":270006,\"journal\":{\"name\":\"Int. J. High Speed Comput.\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. High Speed Comput.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/S0129053396000021\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. High Speed Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/S0129053396000021","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

给定D维中N个点的坐标，Barnes-Hut树算法生成一个有序列表，以便序列中的连续对是最近的邻居，4个点的集合形成一个簇，8个点的集合形成一个更大的簇，以此类推。我们描述了该算法在IBM SP2上使用Fortran 77和MPI消息传递调用的并行实现，并研究了其性能。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Hierarchical Decomposition: a Parallel Implementation of the Barnes-Hut Tree Algorithm

Given the coordinates of N points in D dimensions, the Barnes-Hut tree algorithm produces an ordered list so that successive pairs in the sequence are nearest neighbors, sets of four form a cluster, sets of eight form a bigger cluster, and so on. We describe a parallel implementation of this algorithm on the IBM SP2 using Fortran 77 and MPI message-passing calls, and study its performance.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Int. J. High Speed Comput.

自引率

0.00%

发文量