Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Parallel TreePM Code   We present an algorithm for parallelising the TreePM code. We use both
functional and domain decompositions. Functional decomposition is used to
separate the computation of long range and short range forces, as well as the
task of coordinating communications between different components. Short range
force calculation is time consuming and benefits from the use of domain
decomposition. We have tested the code on a Linux cluster. We get a speedup of
31.4 for 128^3 particle simulation on 33 processors; speedup being better for
larger simulations. The time taken for one time step per particle is 6.5 micro
seconds for a 256^3 particle simulation on 65 processors, thus a simulation
that runs for 4000 time steps takes 5 days on this cluster.

1
The categories of this paper are: cs
0
The categories of this paper are: hep-ph
36
The categories of this paper are: cmp-lg
31
The categories of this paper are: ao-sci
12
The categories of this paper are: nucl-th
21
The categories of this paper are: adap-org
33
The categories of this paper are: plasm-ph
7
The categories of this paper are: hep-th
8
The categories of this paper are: hep-ex
26
The categories of this paper are: bayes-an
10
The categories of this paper are: q-bio
25
The categories of this paper are: patt-sol
2
The categories of this paper are: math
5
The categories of this paper are: gr-qc
11
The categories of this paper are: hep-lat
13
The categories of this paper are: quant-ph