Balance Refinement of Massive Linear Octree Datasets
- Topics:
- Electrical and Electronic
- Tags:
- Balance Refinement Problem,
- Carnegie-Mellon University,
- Constraint,
- Refinement,
- Supercomputing
- Source:
- Carnegie Mellon University
FREE Registration is required
Overview: This white paper deals with the process of enforcing the 2-to-1 constraint on an existing octree dataset called as balance refinement. The balance refinement problem is characterized not only by the sheer volume of data, but also by the intricacy of the 2-to-1 constraint. The paper presents solution that consists of two major algorithms: balance by parts and prioritized ripple propagation. The key idea is to bulk load most of the data into memory only once and enforce the 2-to-1 constraint locally using sophisticated data structure built on the fly. The software package developed has successfully balanced world-record linear octree datasets that are used by real-world supercomputing applications.
(Is this item miscategorized? Does it need more tags? Let us know.)
Format: PDF | Size: 158KB | Date: Apr 2004 | Pages: 23
