Deque-Free Work-Optimal Parallel STL Algorithms

  • Authors:
  • Daouda Traoré;Jean-Louis Roch;Nicolas Maillard;Thierry Gautier;Julien Bernard

  • Affiliations:
  • INRIA Moais research team, CNRS LIG lab., Grenoble University, France;INRIA Moais research team, CNRS LIG lab., Grenoble University, France;Instituto de Informática, Univ. Federal Rio Grande do Sul, Porto Alegre, Brazil;INRIA Moais research team, CNRS LIG lab., Grenoble University, France;INRIA Moais research team, CNRS LIG lab., Grenoble University, France

  • Venue:
  • Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents provable work-optimal parallelizations of STL (Standard Template Library) algorithms based on the work-stealing technique. Unlike previous approaches where a deque for each processor is typically used to locally store ready tasks and where a processor that runs out of work steals a ready task from the deque of a randomly selected processor, the current paper instead presents an original implementation of work-stealing without using any deque but a distributed list in order to bound overhead for task creations. The paper contains both theoretical and experimental results bounding the work/running time.