Chapter

A parallel tree N-body code for heterogeneous clusters

DOI: 10.1007/BFb0030132

ABSTRACT Without Abstract

0 Bookmarks
 · 
29 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: Particle codes which simulate the evolution of self-gravitating systems are a popular tool of contemporary cosmological research. Here we compare two different approach to the parallelization of Tree N-body codes, namely work-sharing and message passing. We also discuss a Dynamical Load Balancing algorithm which we have applied to the work-sharing code. preliminary results show merits and problems of these two approaches.
    Applied Parallel Computing, Computations in Physics, Chemistry and Engineering Science, Second International Workshop, PARA '95, Lyngby, Denmark, August 21-24, 1995, Proceedings; 01/1995
  • [Show abstract] [Hide abstract]
    ABSTRACT: [961, 1114, 884, 1166, 1967, 306, 2 308, 1563, 303, 1748, 1284, 1865, 970, 344, 1131, 955, 310, 907, 243, 954, 307, 997, 1550, 136, 38, 149, 1032]. Abstracting [1125]. Abstraction [1779, 1286, 1970, 529, 1219, 616]. Abstractions [472, 1791]. Academic [633]. ACC [930]. Access [478, 465, 212, 1836, 842, 1184, 1732, 326, 1191, 410, 481]. Accuracy [415]. Accurately [1941]. achievements [1703]. Acoustical [1409]. ACP [281]. Acquiring [1267, 618, 179, 617, 1269]. Acquisition [1267, 61, 62, 1265, 1264, 1249, 58, 1818, 59, 1257, 1261, 1454, 66, 1452, 1427, 56, 1256, 1254]. Across [639]. Action [1988, 1987, 1703, 678, 1522, 251, 1435, 321, 279, 1300, 1706, 1707]. Actions [44]. Active [822, 1839, 572, 571]. Activities [516]. Activity [1836, 66, 1462]. Actor [287, 1743]. ACTRESS [678]. Ada [1373, 1395, 1393, 1383, 1375, 1382, 1377, 1392, 1384, 1385, 1371, 1391, 1394, 1379, 1386, 1372, 1387, 1389, 1378, 1374, 1380]. Ada-9X [1382]. ADAPT [1666]. Adaptability [1513]. Adaptable [1729]...
    08/1999;
  • [Show abstract] [Hide abstract]
    ABSTRACT: We describe a new parallel implementation of the octal-hierarchical tree N-body algorithm on SHared Memory systems (SHM) we have recently developed. Pursuing an effort to optimize as much as possible the code on a generic SHM we have modified the original algorithm introduced by Barnes and Hut, introducing a new scheme of “grouping” of particle interactions. We present speedup and efficiency results.
    Parallel Computation, 4th International ACPC Conference Including Special Tracks on Parallel Numerics (ParNum'99) and Parallel Computing in Image Processing, Video Processing, and Multimedia, Salzburg, Austria, February 1999, Proceedings; 01/1999