COMPILE-TIME ANALYSIS AND OPTIMIZATION OF EXPLICITLY PARALLEL PROGRAMS*
From MaRDI portal
Recommendations
Cites work
- An Efficient Heuristic Procedure for Partitioning Graphs
- scientific article; zbMATH DE number 986407 (Why is no real title available?)
- scientific article; zbMATH DE number 4064447 (Why is no real title available?)
- scientific article; zbMATH DE number 42110 (Why is no real title available?)
- scientific article; zbMATH DE number 3592938 (Why is no real title available?)
- Testing flow graph reducibility
Cited in
(14)- Run-time data-flow analysis.
- Precise interprocedural dependence analysis of parallel programs
- Annotation guided collection of context-sensitive parallel execution profiles
- Syntax-directed divide-and-conquer data-flow analysis
- Automatic Static Cost Analysis for Parallel Programs
- Analysis of recursively parallel programs
- scientific article; zbMATH DE number 1822437 (Why is no real title available?)
- scientific article; zbMATH DE number 4020458 (Why is no real title available?)
- scientific article; zbMATH DE number 1191257 (Why is no real title available?)
- scientific article; zbMATH DE number 1281980 (Why is no real title available?)
- Interprocedural analysis and optimization
- Euro-Par 2004 Parallel Processing
- New shape analysis and interprocedural techniques for automatic parallelization of C codes
- Parallel program analysis via range splitting
This page was built for publication: COMPILE-TIME ANALYSIS AND OPTIMIZATION OF EXPLICITLY PARALLEL PROGRAMS*
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4366892)