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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Heywood, Todd (VerfasserIn), Mehrotra, Kishan (VerfasserIn), Ranka, Sanjay (VerfasserIn)
Format: Buch
Sprache:English
Veröffentlicht: Edinburgh 1993
Schriftenreihe:University <Edinburgh> / Department of Computer Science: CSR 27
Schlagworte:
Zusammenfassung: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."
Beschreibung:15 S.

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand!