Title :
On partitioning dynamic adaptive grid hierarchies
Author :
Parashar, Manish ; Browne, James C.
Author_Institution :
Dept. of Comput. Sci., Texas Univ., Austin, TX, USA
Abstract :
This paper presents a computationally efficient run-time partitioning and load-balancing scheme for the distributed adaptive grid hierarchies that underlie adaptive mesh-refinement methods. The partitioning scheme yields an efficient parallel computational structure that maintains locality to reduce communications. Further, it enables dynamic re-partioning and load balancing of the adaptive grid hierarchy to be performed cost-effectively. The run-time partitioning support presented has been implemented within the framework of a data-management infrastructure supporting dynamic distributed data-structures for parallel adaptive numerical techniques. This infrastructure is the foundational layer of a computational toolkit for the Binary Black-Hole NSF Grand Challenge project
Keywords :
concurrency control; data structures; distributed databases; partial differential equations; resource allocation; software performance evaluation; Binary Black-Hole; Grand Challenge project; adaptive mesh-refinement methods; computational toolkit; cost-effective; data management; distributed adaptive grid hierarchies; distributed data structures; dynamic adaptive grid hierarchy partitioning; dynamic repartitioning; load balancing; parallel adaptive numerical techniques; parallel computational structure; partial differential equations; run-time partitioning; Adaptive mesh refinement; Concurrent computing; Contracts; Costs; Distributed computing; Grid computing; Parallel processing; Partial differential equations; Physical layer; Runtime;
Conference_Titel :
System Sciences, 1996., Proceedings of the Twenty-Ninth Hawaii International Conference on ,
Conference_Location :
Wailea, HI
Print_ISBN :
0-8186-7324-9
DOI :
10.1109/HICSS.1996.495511
