The performance of Barnes-Hut n-body simulation in the abstract:

Abstract: "We give an algorithm directly implementing the Barnes- Hut oct-tree technique for N-body simulation, and provide expected time and space results which are both architecture independent and independent of the distribution of bodies in the universe. The analysis uses approximations who...

Full description

Saved in:
Bibliographic Details
Main Authors: Heywood, Todd (Author), Mehrotra, Kishan (Author), Ranka, Sanjay (Author)
Format: Book
Language:English
Published: Edinburgh 1993
Series:University <Edinburgh> / Department of Computer Science: CSR 27
Subjects:
Summary:Abstract: "We give an algorithm directly implementing the Barnes- Hut oct-tree technique for N-body simulation, and provide expected time and space results which are both architecture independent and independent of the distribution of bodies in the universe. The analysis uses approximations whose accuracy depends on N being large; nevertheless it provides the first analytical complexity result for a parallel Barnes-Hut N-body algorithm that we are aware of. The results also expose relationships between architecture latency and algorithm tolerance to non- uniform body distributions."
Physical Description:15 S.

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection!