Etree—ADatabase-orientedMethodforGeneratingLarge.pptVIP

Now, let’s change our gear to look at the evaluation of the etree method. This is the set of questions we try to answer. First of all, is the etree method feasible? If so, how does the running vary with the physical memory size? And further what is the impact of auto navigation, and what is the impact of local balancing? To see the feasibility of the etree method, we configure the physical memory to be 128MB for this set of experiments. Memory size does not have a significant impact on the running time The etree is not relying on the operating systems internal caching mechanism to achieve its performance Etree — A Database-oriented Method for Generating Large Octree Meshes David R. O’Hallaron1,2 Tiankai Tu1 Julio C. López2 1School of Computer Science 2Electrical and Computer Engineering Department Carnegie Mellon University tutk@cs.cmu.edu jclopez@cs.cmu.edu droh@cs.cmu.edu Motivation Goal : Make it possible to run large-scale physical simulations on PC’s with limited physical memory Mesh generation Mesh t Simulation results Physical model Visuali- zation Solver Approach : Index and store the datasets in databases and compute on the databases directly Requires research at the intersection of computer systems, scientific computing, and databases Octree mesh generation a b c d e f g h i j k l m a compromise between structure and modeling power balance requirement (2-to-1 constraint) can be implemented in-core or out-of-core h1 h2 h3 h4 element/octant a b c d e f g h i j k l m h2 h1 h4 h3 master node slave node Etree mesh generation overview A general method for manipulating large out-of-core octrees by querying databases unbalanced octree application-specific input construct etree library transform etree library balanced octree balance etree library element database node database Etree library components Application (e.g.construct, balance) Etree library B-Tree Linear quadtree Auto navigation Local balancing Etree API Etree API — a simple Applicat