From: wrankin@cerberus.ee.duke.edu (William T. Rankin)
Newsgroups: comp.parallel.pvm
Subject: Re: Barnes-Hut Algorithms using PVM
Date: 13 Nov 1998 09:18:20 -0500
Organization: Duke University, Durham, NC, USA
Message-Id: <72hf3c$n6o$1@cerberus.ee.duke.edu>
References: <72aurt$bb0$1@news.kren.nm.kr>


Newsgroups: comp.parallel.pvm
Subject: Re: Barnes-Hut Algorithms using PVM
Summary: 
Expires: 
References: <72aurt$bb0$1@news.kren.nm.kr>
Sender: 
Followup-To: 
Distribution: 
Organization: 
Keywords: 
Cc: 

In article <72aurt$bb0$1@news.kren.nm.kr>,
Tae-Sun Chung  <tschung@snu.ac.kr> wrote:
>Would anybody know where I can download C source code for Bares-Hut
>algorithm using PVM or pure Barns-Hut C source code?

While it's not quite a "Barnes-Hut" treecode, our group has developed a
portable hybrid of the Fast Multipole Method (ala. Greengard-Rokhlin) 
that runs under PVM.  The program is called DPMTA and provides a simple
interface for ease of integration into existing applications.

More information on DPMTA and other n-body codes from our research group
can be found on our WWW page at:

  http://www.ee.duke.edu/Research/SciComp

The DPMTA specific page is at:

  http://www.ee.duke.edu/Research/Scicomp/Docs/Dpmta

Hope this helps,

-bill rankin
-- 
bill rankin ...................................... philosopher/coffee-drinker
wrankin@ee.duke.edu ........................................ doctoral wannabe
duke university dept. of electrical engr ......... scientific computing group