A shape analysis for optimizing parallel graph programs

DOI10.1145/1926385.1926405zbMath1284.68196OpenAlexW4251148852MaRDI QIDQ5408541

Roman Manevich, Keshav Pingali, Dimitrios Prountzos, 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

zbMATH Keywords

parallelismstatic analysiscompiler optimizationconcurrencyshape analysisabstract interpretationsynchronization overheadsamorphous data-parallelismcautious operatorsirregular programsoptimistic parallelization

Mathematics Subject Classification ID

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

Related Items (1)

Using Abstract Interpretation to Correct Synchronization Faults

Uses Software

• Autolocker

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