Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Implementation of a Binary Tree Driver (OAKc) in Cactus
 

Summary: Implementation of a Binary Tree Driver
(OAKc) in Cactus
Jeff DeReus
Center for Computation & Technology
Louisiana State University
Introduction
Applications
N-body problems
Computational Fluid Dynamics
Difficulties
The use of parallel processors
Galaxy formation modeling
1011 stars == 109 years for one iteration using N2
algorithms
1 year using N log2N algorithms
Binary Trees
Ordered binary trees vs. binary heaps
Efficiency due to ability to cut half of the
tree with each comparison
Gains in parallel performance

  

Source: Allen, Gabrielle - Department of Computer Science, Louisiana State University

 

Collections: Computer Technologies and Information Sciences