Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

SPAWN: An Iterative, Potentials-Based, Dynamic Scheduling and Partitioning Tool

Abstract : Many applications of physics modeling use regular meshes on which computations of highly variable cost can occur. Distributing the underlying cells over manycore architec-tures is a critical load balancing step that should increase the period until another step is required. Graph partitioning tools are known to be very effective for such problems, but they exhibit scalability problems as the number of cores and the number of cells increases. We introduce a dynamic task scheduling approach inspired by physical particles interactions. Our method allows cores to virtually move over a 2D/3D mesh of tasks and uses a Voronoi domain decomposition to balance workload among cores. Displacements of cores are the result of force computations using a carefully chosen pair potential. We evaluate our method against graph partitioning tools and existing task schedulers with a representative physical application, and demonstrate the relevance of our approach.
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Jean-Charles Papin Connect in order to contact the contributor
Submitted on : Tuesday, November 3, 2015 - 4:11:10 PM
Last modification on : Saturday, June 25, 2022 - 7:46:14 PM
Long-term archiving on: : Thursday, February 4, 2016 - 11:21:46 AM


Files produced by the author(s)


  • HAL Id : hal-01223897, version 1


Jean-Charles Papin, Christophe Denoual, Laurent Colombet, Raymond Namyst. SPAWN: An Iterative, Potentials-Based, Dynamic Scheduling and Partitioning Tool. SuperComputing'15 - RESPA Workshop, Nov 2015, Austin, United States. ⟨hal-01223897⟩



Record views


Files downloads