| dc.contributor.advisor | Sinha, SK | |
| dc.contributor.author | Champaka, M.K. | |
| dc.date.accessioned | 2025-10-15T11:09:16Z | |
| dc.date.available | 2025-10-15T11:09:16Z | |
| dc.date.submitted | 1991 | |
| dc.identifier.uri | https://etd.iisc.ac.in/handle/2005/7183 | |
| dc.description.abstract | Dependence analysis, which is the most critical component of
PPT, has been described in this chapter. In order to establish
dependence relations between multiple occurrences of different
types of variables such as single-dimensional arrays and
multidimensional arrays, two algorithms have been developed. These
algorithms named, Test-SDA and Test-MDA have been described in
this chapter. The interprocedural analysis carried out in PPT to
accurately determine the dependence relation in the presence of
subroutine calls is also presented. The dependence information
obtained from the analysis is stored in the form of a dependence
graph and direction vectors in the dependence graph are used by
another algorithm called Loop-Analyze to detect the
parallelizable loop. | |
| dc.language.iso | en_US | |
| dc.relation.ispartofseries | T03125 | |
| dc.rights | I grant Indian Institute of Science the right to archive and to make available my thesis or dissertation in whole or in part in all forms of media, now hereafter known. I retain all proprietary rights, such as patent rights. I also retain the right to use in future works (such as articles or books) all or part of this thesis or dissertation | |
| dc.subject | Affine Loop Nests | |
| dc.subject | Dependence Graph | |
| dc.subject | Parallelizable Loops | |
| dc.title | Design and implementation of a fortran to occam parallelizing parallel translator | |
| dc.type | Thesis | |
| dc.degree.name | MSc Engg | |
| dc.degree.level | Masters | |
| dc.degree.grantor | Indian Institute of Science | |
| dc.degree.discipline | Engineering | |
