ECE 497 MF Final Report : The Formation and Simulation of a “ Whole Program ” Gated Singular Assignment Program Dependence Graph

The Gated Single Assignment Program Dependence Graph (GSA PDG) provides an executable dataflow representation for imperative programs that might be usefu l for hardware synthesis. Existing publications on GSA have not attempted to define interpretation semantics for whole programs including side effects ( ie. memory accesses and procedure calls). Published works also contain errors even for side-effect-free programs. We have addressed these shortcomings and developed a more complete specification of a GSA form that is able to represent entire programs including side effects. We have also implemented a compiler pass to generate GSA for side-effect-procedures. Finally, we have used simulation to verify our semantics and characterize the parallelism in the GSA graph.