Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Accelerating Fluids01:17

Accelerating Fluids

When a fluid is in constant acceleration, the pressure and buoyant force equations are modified. Suppose a beaker is placed in an elevator accelerating upward with a constant acceleration, a. In the beaker, assume there is a thin cylinder of height h with an infinitesimal cross-sectional area, ΔS.
The motion of the liquid within this infinitesimal cylinder is considered to obtain the pressure difference. Three vertical forces act on this liquid:
Fast Decoupled and DC Powerflow01:24

Fast Decoupled and DC Powerflow

The fast decoupled power flow method addresses contingencies in power system operations, such as generator outages or transmission line failures. This method provides quick power flow solutions, essential for real-time system adjustments. Fast decoupled power flow algorithms simplify the Jacobian matrix by neglecting certain elements, leading to two sets of decoupled equations:
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Maxwell-Boltzmann Distribution: Problem Solving01:20

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
Statgraphics01:10

Statgraphics

Statgraphics is a comprehensive statistical software suite designed for both basic and advanced data analysis. Originating in 1980 at Princeton University under Dr. Neil W. Polhemus, it was one of the pioneering tools for statistical computing on personal computers, with its public release in 1982 marking an early milestone in data science software. Over the years, it has evolved into a robust platform for data science, offering tools for regression analysis, ANOVA, multivariate statistics,...
Ampere-Maxwell's Law: Problem-Solving01:17

Ampere-Maxwell's Law: Problem-Solving

A parallel-plate capacitor with capacitance C, whose plates have area A and separation distance d, is connected to a resistor R and a battery of voltage V. The current starts to flow at t = 0. What is the displacement current between the capacitor plates at time t? From the properties of the capacitor, what is the corresponding real current?
To solve the problem, we can use the equations from the analysis of an RC circuit and Maxwell's version of Ampère's law.
For the first part of the problem,...

You might also read

Related Articles

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

Sort by
Same author

Low-Alpha-Cellulose-Based Membranes.

Polymers·2025
Same author

A comparison of machine learning methods for recovering noisy and missing 4D flow MRI data.

International journal for numerical methods in biomedical engineering·2024
Same author

Multi-Modal Medical Image Registration with Full or Partial Data: A Manifold Learning Approach.

Journal of imaging·2021
Same author

Structural and Parametric Optimization of S-CO<sub>2</sub> Nuclear Power Plants.

Entropy (Basel, Switzerland)·2021
Same author

Integrating multi-fidelity blood flow data with reduced-order data assimilation.

Computers in biology and medicine·2021
Same author

Modeling and Reducing the Effect of Geometric Uncertainties in Intracranial Aneurysms with Polynomial Chaos Expansion, Data Decomposition, and 4D-Flow MRI.

Cardiovascular engineering and technology·2021
Same journal

Analysis of strength degradation of coal and rock masses and stability of mined areas under long term immersion environment.

PloS one·2026
Same journal

Biogenic Silver-Selenium nanocomposite with anticancer activity and potent efficacy against vancomycin-resistant Staphylococcus aureus.

PloS one·2026
Same journal

Preparation and physicochemical characterization of a biodegradable chitosan/carboxymethyl cellulose hydrogel synthesized in NaOH/urea medium.

PloS one·2026
Same journal

Action-guilt, survivor-guilt, and depression in combat-related PTSD.

PloS one·2026
Same journal

Explainable machine learning for predicting activities of daily living at discharge in stroke patients: A retrospective study using SHAP interpretability.

PloS one·2026
Same journal

Deep learning based two-way feature depiction model for brain tumor detection.

PloS one·2026
See all related articles

Related Experiment Videos

Accelerating the Gillespie Exact Stochastic Simulation Algorithm using hybrid parallel execution on graphics

Ivan Komarov1, Roshan M D'Souza

  • 1Department of Mechanical Engineering, Complex Systems Simulation Lab, University of Wisconsin-Milwaukee, Milwaukee, Wisconsin, United States of America.

Plos One
|November 16, 2012
PubMed
Summary
This summary is machine-generated.

This study introduces a novel, exact Gillespie Stochastic Simulation Algorithm (GSSA) variant accelerated by graphics processing units (GPUs). This GPU-accelerated GSSA significantly enhances simulation speed for low reactant concentrations in biochemical reactions.

Related Experiment Videos

Area of Science:

  • Computational Biology
  • Biophysics
  • Chemical Kinetics

Background:

  • The Gillespie Stochastic Simulation Algorithm (GSSA) is crucial for simulating biochemical reactions with low reactant concentrations, where deterministic methods fail.
  • Serial GSSA implementations are computationally expensive, limiting their use for complex models and parameter sweeps.
  • Stochastic simulation is essential for understanding inherent randomness in biological systems.

Purpose of the Study:

  • To develop a novel variant of the exact GSSA that leverages graphics processing units (GPUs) for significant acceleration.
  • To overcome the computational bottlenecks of traditional GSSA methods, enabling faster and more extensive simulations.
  • To improve the efficiency of parameter sweep exercises in stochastic reaction kinetics.

Main Methods:

  • Parallelization of a single GSSA realization across GPU threads (fine-grained parallelism).
  • Coarse-grained parallelism by executing multiple warps on different multi-processors to generate multiple trajectories simultaneously.
  • Development of novel data structures and algorithms to minimize memory traffic, a key bottleneck in GSSA.

Main Results:

  • Achieved performance gains of 8×-120× compared to state-of-the-art serial algorithms.
  • Demonstrated significant speedups across various model types.
  • Successfully reduced the computational cost of simulating stochastic reaction kinetics.

Conclusions:

  • The novel GPU-accelerated GSSA offers a substantial performance improvement over serial methods.
  • This approach makes complex stochastic simulations and large-scale parameter sweeps computationally feasible.
  • The optimized GSSA variant is a valuable tool for computational biology and related fields.