Estimation of Parallel Complexity with Rewriting Techniques - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Estimation of Parallel Complexity with Rewriting Techniques

Abstract

We show how monotone interpretations – a termination analysis technique for term rewriting systems – can be used to assess the inherent parallelism of recursive programs manipulating inductive data structures. As a side effect, we show how monotone interpretations specify a parallel execution order, and how our approach extends naturally affine scheduling – a powerful analysis used in parallelising compilers – to recursive programs. This work opens new perspectives in automatic parallelisation.
Fichier principal
Vignette du fichier
rewriting_parallelism_articleHAL.pdf (254.57 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01345914 , version 1 (20-07-2016)

Licence

Attribution

Identifiers

  • HAL Id : hal-01345914 , version 1

Cite

Christophe Alias, Carsten Fuhs, Laure Gonnord. Estimation of Parallel Complexity with Rewriting Techniques. Workshop on Termination, Sep 2016, Obergurgl, Austria. ⟨hal-01345914⟩
281 View
195 Download

Share

Gmail Facebook X LinkedIn More