NDLI: Revisiting the space-filling curves for storage, reordering and partitioning mesh based data in scientific computing

Content Provider	IEEE Xplore Digital Library
Author	Pavanakumar, M. Kaushik, K.N.
Copyright Year	2013
Description	Author affiliation: Comput. & Theor. Fluid Dynamics Div., Nat. Aerosp. Labs., Bangalore, India (Pavanakumar, M.; Kaushik, K.N.)
Abstract	Graph based algorithms are widely used for unstructured mesh partitioning. They give rise to non-contiguous partitions optimized for minimum communication between partitions. Space-filling curves (SFC) on the other hand give better balanced partitions having higher communication cost than graphs. In this work, we show that SFC based algorithms are competitive to graph based methods, especially for I/O and compute intensive scientific applications. The basic idea used in this work is the SFC reordered storage in Hierarchical Data Format (HDF), which simplifies mesh partitioning, improves I/O bandwidth and at the same time provide cache friendly memory access. The ordering enables us to read the mesh entities as contiguous chunks using parallel I/O, which precludes the use of elaborate partitioning tools. We show comparisons of various partition quality metrics between partitions obtained from SFC and graph based methods for four types of unstructured meshes. The results show that SFC outperforms graph based partitioning in all the quality metrics except the communication volume. Finally, we show that storing the mesh entities using SFC leads to better cache locality without additional local reordering effort.
Sponsorship	IEEE Comput. Soc.
Starting Page	362
Ending Page	367
File Size	1396989
Page Count	6
File Format	PDF
ISBN	9781479907304
DOI	10.1109/HiPC.2013.6799097
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-12-18
Publisher Place	India
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Partitioning algorithms Bandwidth Synchronization Scalability Load management Laboratories
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Dynamic Load Balancing for Unstructured Meshes on Space-Filling Curves

Parallel domain decomposition and load balancing using space-filling curves

Parallel mesh partitioning based on space filling curves

Parallel hypergraph partitioning for scientific computing

Hypergraph-based Dynamic Load Balancing for Adaptive Scientific Computations

A General Space-filling Curve Algorithm for Partitioning 2D Meshes

Balancing Parallel Applications on Multi-core Processors Based on Cache Partitioning

A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition

Effectiveness of a Dynamic Load Balancing Library for Scientific Applications

Revisiting the space-filling curves for storage, reordering and partitioning mesh based data in scientific computing

Similar Documents

Dynamic Load Balancing for Unstructured Meshes on Space-Filling Curves

Parallel domain decomposition and load balancing using space-filling curves

Parallel mesh partitioning based on space filling curves

Parallel hypergraph partitioning for scientific computing

Hypergraph-based Dynamic Load Balancing for Adaptive Scientific Computations

A General Space-filling Curve Algorithm for Partitioning 2D Meshes

Balancing Parallel Applications on Multi-core Processors Based on Cache Partitioning

A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition

Effectiveness of a Dynamic Load Balancing Library for Scientific Applications

Revisiting the space-filling curves for storage, reordering and partitioning mesh based data in scientific computing