A shape analysis for optimizing parallel graph programs

DOI10.1145/1926385.1926405zbMATH Open1284.68196OpenAlexW4251148852MaRDI QIDQ5408541FDOQ5408541

Authors: Dimitrios Prountzos, Roman Manevich, Keshav Pingali, Kathryn S. McKinley 

Publication date: 10 April 2014

Published in: Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1926385.1926405

Recommendations

• Parallelizing graph construction operations in programs with cyclic graphs
• Identifying parallelism in programs with cyclic graphs.
• Shape Analysis by Graph Decomposition
• Optimizing declarative parallel distributed graph processing by using constraint solvers
• Towards dynamic shaping

zbMATH Keywords

shape analysisabstract interpretationconcurrencyparallelismstatic analysiscompiler optimizationsynchronization overheadsamorphous data-parallelismcautious operatorsirregular programsoptimistic parallelization

Mathematics Subject Classification ID

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

Cited In (4)

• Parallelizing graph construction operations in programs with cyclic graphs
• Using abstract interpretation to correct synchronization faults
• A Shape Analysis for Non-linear Data Structures
• Optimizing declarative parallel distributed graph processing by using constraint solvers

Uses Software

• Autolocker

This page was built for publication: A shape analysis for optimizing parallel graph programs

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