A Lossy, Synchronization-Free, Race-Full, But Still Acceptably Accurate Parallel Space-Subdivision Tree Construction Algorithm

A Lossy, Synchronization-Free, Race-Full, But Still Acceptably Accurate Parallel Space-Subdivision Tree Construction Algorithm

We present a new synchronization-free space-subdivision tree construction algorithm. Despite data races, this algorithm produces trees that are consistent enough for the client Barnes-Hut center of mass and force computation phases to use successfully. Our performance results show that eliminating s...

Full description

Bibliographic Details
Main Author: Rinard, Martin
Other Authors: Program Analysis
Published: 2012
Subjects:
Data Structure Repair
Data Races
Acceptability
Parallel Computing
Synchronization
Online Access:http://hdl.handle.net/1721.1/69177

Internet

http://hdl.handle.net/1721.1/69177

Similar Items