Abstract

Abstract In this paper, we describe an implementation of the Barnes–Hut treecode on a cluster of PCs (Beowulf-class machines) equipped with GRAPE hardware. Our implementation is designed to achieve good performance on clusters of GRAPE with a relatively slow network, such as the standard Gigabit Ethernet. With 12 processors, the speedup over single-processor code reaches around 10. Our code is available on the web.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.