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.
Liste complète des métadonnées

Cited literature [11 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01345914
Contributor : Laure Gonnord <>
Submitted on : Wednesday, July 20, 2016 - 1:43:12 PM
Last modification on : Wednesday, April 3, 2019 - 1:30:10 AM

File

rewriting_parallelism_articleH...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

  • HAL Id : hal-01345914, version 1

Collections

Citation

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

Share

Metrics

Record views

441

Files downloads

193