PRO: a model for the design and analysis of efficient and scalable parallel algorithms

  • Authors:

  • Assefaw Hadish Gebremedhin;Mohamed Essaïdi;Isabelle Guérin Lassous;Jens Gustedt;Jan Arne Telle

  • Affiliations:

  • Old Dominion University;INRIA Sophia-Antipolis, France;UFR Informatique/UCBL, LIP/ENS Lyon, France;INRIA Lorraine & LORIA, France;University of Bergen, Norway

  • Venue:
  • Nordic Journal of Computing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a new parallel computation model called the Parallel Resource-Optimal computation model. PRO is a framework being proposed to enable the design of efficient and scalable parallel algorithms in an architecture-independent manner, and to simplify the analysis of such algorithms. A focus on three key features distinguishes PRO from existing parallel computation models. First, the design and analysis of a parallel algorithm in the PRO model is performed relative to the time and space complexity of a sequential reference algorithm. Second, a PRO algorithm is required to be both time- and space-optimal relative to the reference sequential algorithm. Third, the quality of a PRO algorithm is measured by the maximum number of processors that can be employed while optimality is maintained. Inspired by the Bulk Synchronous Parallel model, an algorithm in the PRO model is organized as a sequence of supersteps. Each superstep consists of distinct computation and communication phases, but the supersteps are not required to be separated by synchronization barriers. Both computation and communication costs are accounted for in the runtime analysis of a PRO algorithm. Experimental results on parallel algorithms designed using the PRO model--and implemented using its accompanying programming environment SSCRAP--demonstrate that the model indeed delivers efficient and scalable implementations on a wide range of platforms.