Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Sampling Plans

Sampling Plans

Sampling is a crucial step in analytical chemistry, allowing researchers to collect representative data from a large population. Common sampling methods include random, judgmental, systematic, stratified, and cluster sampling.
Random sampling is a method where each member of the population has an equal chance of being selected for the sample. It involves selecting individuals randomly, often using random number generators or lottery-type methods. For example, when analyzing the properties of a...

Distributed Loads: Problem Solving

Distributed Loads: Problem Solving

Beams are structural elements commonly employed in engineering applications requiring different load-carrying capacities. The first step in analyzing a beam under a distributed load is to simplify the problem by dividing the load into smaller regions, which allows one to consider each region separately and calculate the magnitude of the equivalent resultant load acting on each portion of the beam. The magnitude of the equivalent resultant load for each region can be determined by calculating...

Maxwell-Boltzmann Distribution: Problem Solving

Maxwell-Boltzmann Distribution: Problem Solving

Individual molecules in a gas move in random directions, but a gas containing numerous molecules has a predictable distribution of molecular speeds, which is known as the Maxwell-Boltzmann distribution, f(v).
This distribution function f(v) is defined by saying that the expected number N (v1,v2) of particles with speeds between v1 and v2 is given by

Uniform Depth Channel Flow: Problem Solving

Uniform Depth Channel Flow: Problem Solving

To calculate the flow rate for a trapezoidal channel, first, identify the bottom width, side slope, and flow depth of the channel. The cross-sectional area (A) corresponding to the depth of flow (y), channel bottom width (B), and side slope (θ) is determined by:Next, calculate the wetted perimeter, which includes the bottom width and the sloped side lengths in contact with the water. Using the values of the cross-sectional area and the wetted perimeter, determine the hydraulic radius by...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

Adsorption mechanisms of lead and cadmium by alteration residues of coal slime-based activated materials: Theory and experiment.

Environmental research·2026

Same author

Exploring cross-city hospital visiting trips for medical service evaluation in urban agglomeration areas based on automobile navigation data.

BMC health services research·2026

Same author

Pore Size-Dependent Origin of CO<sub>2</sub> Adsorption Thermodynamics within Porous Carbon under Broad-Ranging Operation Pressures.

ACS applied materials & interfaces·2025

Same author

Unveiling the coupling effect of sp<sup>2</sup> domain size and local active sites in switching the selectivity of nanocarbon catalysts toward the oxygen electro-reduction.

Nature communications·2025

Same author

Hydrated ionic polymer for thermochromic smart windows in buildings.

Nature communications·2025

Same author

Enhancing out-of-hospital cardiac arrest survival in China through the 5-minute social rescue circle implementation.

Resuscitation·2025

Search research articles

Related Experiment Video

Updated: Mar 23, 2026

Laboratory Drop Towers for the Experimental Simulation of Dust-aggregate Collisions in the Early Solar System

Laboratory Drop Towers for the Experimental Simulation of Dust-aggregate Collisions in the Early Solar System

Published on: June 5, 2014

Developing Subdomain Allocation Algorithms Based on Spatial and Communicational Constraints to Accelerate Dust Storm

Zhipeng Gui^1,2, Manzhu Yu², Chaowei Yang²

¹School of Remote Sensing and Information Engineering, Wuhan University, Wuhan, Hubei Province, China.

|April 5, 2016

Summary

This summary is machine-generated.

Optimizing dust storm simulations requires efficient parallel processing. This study introduces three algorithms, with the K-Means and Kernighan-Lin (K&K) method significantly improving performance through better subdomain allocation.

More Related Videos

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

Scattering And Absorption of Light in Planetary Regoliths

Scattering And Absorption of Light in Planetary Regoliths

Published on: July 1, 2019

Related Experiment Videos

Last Updated: Mar 23, 2026

Laboratory Drop Towers for the Experimental Simulation of Dust-aggregate Collisions in the Early Solar System

Laboratory Drop Towers for the Experimental Simulation of Dust-aggregate Collisions in the Early Solar System

Published on: June 5, 2014

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

Scattering And Absorption of Light in Planetary Regoliths

Scattering And Absorption of Light in Planetary Regoliths

Published on: July 1, 2019

Area of Science:

Environmental Science
Computational Science
Atmospheric Science

Background:

Dust storms pose significant environmental, health, and economic risks.
Dust storm models are crucial for prediction but are computationally intensive.
High-performance computing (HPC) is used for dust storm simulations via parallel processing, but inefficient subdomain allocation can hinder performance.

Purpose of the Study:

To develop and evaluate algorithms for optimizing subdomain allocation in parallel dust storm simulations.
To minimize total execution time and communication costs in HPC environments.
To enhance the efficiency of numerical weather prediction and atmospheric modeling.

Main Methods:

Developed three novel algorithms: Integer Linear Programming (ILP), K-Means and Kernighan-Lin combined (K&K), and Automatic Seeded Region Growing (ASRG).
Algorithms consider spatial and communicational constraints for load balancing and reduced communication overhead.
Evaluated algorithm performance and adopted K&K for Non-hydrostatic Mesoscale Model (NMM-dust) simulations.

Main Results:

The K&K algorithm demonstrated superior performance in optimizing subdomain allocation compared to ILP and ASRG.
K&K significantly improved simulation performance in NMM-dust experiments against MPI's default sequential allocation.
The proposed allocation strategies effectively reduce execution time and communication costs.

Conclusions:

The K&K algorithm offers a significant advancement in parallel dust storm simulation efficiency.
Optimized subdomain allocation is critical for improving the performance of HPC-based environmental models.
This approach is transferable to other atmospheric and numerical modeling applications.