Pith. sign in

REVIEW 1 cited by

Source-to-Source Automatic Differentiation of OpenMP Parallel Loops

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2111.01861 v1 pith:RH3MPEMJ submitted 2021-11-02 cs.MS cs.LGcs.PF

classification cs.MScs.LGcs.PF
keywords differentiationautomaticopenmpgradientsmodeparallelprogramsreverse
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper presents our work toward correct and efficient automatic differentiation of OpenMP parallel worksharing loops in forward and reverse mode. Automatic differentiation is a method to obtain gradients of numerical programs, which are crucial in optimization, uncertainty quantification, and machine learning. The computational cost to compute gradients is a common bottleneck in practice. For applications that are parallelized for multicore CPUs or GPUs using OpenMP, one also wishes to compute the gradients in parallel. We propose a framework to reason about the correctness of the generated derivative code, from which we justify our OpenMP extension to the differentiation model. We implement this model in the automatic differentiation tool Tapenade and present test cases that are differentiated following our extended differentiation procedure. Performance of the generated derivative programs in forward and reverse mode is better than sequential, although our reverse mode often scales worse than the input programs.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. DaCe AD: Unifying High-Performance Automatic Differentiation for Machine Learning and Scientific Computing

    cs.LG 2025-09 conditional novelty 6.0 of 10

    DaCe AD automatically differentiates scientific Python and Fortran code through an SDFG intermediate representation, beating JAX JIT across NPBench with a 4.1x geometric mean speedup.

Pith tools