Improvements to the Psi-SSA representation

Details Improvements to the Psi-SSA representation Improvements to the Psi-SSA representation

2007-05-15

arxiv.org/abs/0705.2126v1

Published in proceedings for the workshop "Software and Compilers for Embedded Systems (SCOPES) 2007" (20/04/2007)

Computer Science

Programming Languages

Scientific paper

Modern compiler implementations use the Static Single Assignment representation as a way to efficiently implement optimizing algorithms. However this representation is not well adapted to architectures with a predicated instruction set. The Psi-SSA representation extends the SSA representation such that standard SSA algorithms can be easily adapted to an architecture with a fully predicated instruction set. A new pseudo operation, the Psi operation, is introduced to merge several conditional definitions into a unique definition.

Affiliated with

Also associated with

No associations

Rating

Improvements to the Psi-SSA representation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Improvements to the Psi-SSA representation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improvements to the Psi-SSA representation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-623048