Distributing and parallelizing non-canonical loops

DOI10.1007/978-3-031-24950-1_1zbMATH Open1529.68078OpenAlexW4296547121MaRDI QIDQ6132484FDOQ6132484

Authors: Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller 

Publication date: 17 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-24950-1_1

zbMATH Keywords

abstract interpretationprogram analysisprogram transformationautomatic parallelizationdependency analysisloop optimization

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Cites Work

• Title not available (Why is that?)
• The size-change principle for program termination
• A predicative analysis of structural recursion
• Title not available (Why is that?)
• On the coverings of graphs
• The program dependence graph and its use in optimization
• The Organization of Computations for Uniform Recurrence Equations
• New Computational Paradigms
• Interaction Graphs
• Weighted Relational Models of Typed Lambda-Calculi
• Title not available (Why is that?)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Distributing and parallelizing non-canonical loops

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132484)