Modular implementation of dynamic algorithm switching in parallel simulations

  • Authors:

  • Pilsung Kang

  • Affiliations:

  • Flash Solution Software Development, Samsung Electronics, Hwasung, South Korea

  • Venue:
  • Cluster Computing
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a modular approach to implementing dynamic algorithm switching for parallel scientific software. By using a compositional framework based on function call interception techniques, our proposed method transparently integrates algorithm switching code with a given program without directly modifying the original code structure. Through fine-grained control of algorithmic behavior of an application at the level of functions, our approach supports design and implementation of application-specific switching scenarios in a modular way. Our approach encourages algorithm switching to dynamically perform at the loop end of a parallel simulation, where cooperating processes in concurrent execution typically synchronize and intermediate computation results are consistent. In this way, newly added switching operations do not cause race conditions that may produce unreliable computation results in parallel simulations. By applying our method to a real-world scientific application and adapting its algorithmic behavior to the properties of input problems, we demonstrate the applicability and effectiveness of our approach to constructing efficient parallel simulations.