pith. sign in

arxiv: 1211.4101 · v3 · pith:TF7HVY2Inew · submitted 2012-11-17 · 💻 cs.DC · cs.PL

Optimizing Synchronization Algorithm for Auto-parallelizing Compiler

classification 💻 cs.DC cs.PL
keywords dependencecompileroptimizesynchronizationauto-parallelizingeliminatesynchronizeaccordance
0
0 comments X
read the original abstract

In this paper, we focus on the need for two approaches to optimize producer and consumer synchronization for auto-parallelizing compiler. Emphasis is placed on the construction of a criterion model by which the compiler reduce the number of synchronization operations needed to synchronize the dependence in a loop and perform optimization reduces the overhead of enforcing all dependence. In accordance with our study, we transform to modify and eliminate dependence on iteration space diagram (ISD), and carry out the problems of acyclic and cyclic dependence in detail. we eliminate partial dependence and optimize the synchronize instructions. Some didactic examples are included to illustrate the optimize procedure.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.