Show simple item record

dc.contributor.advisorSrikant, Y N
dc.contributor.authorJanaki, S
dc.date.accessioned2005-03-09T06:59:19Z
dc.date.accessioned2018-07-31T04:38:43Z
dc.date.available2005-03-09T06:59:19Z
dc.date.available2018-07-31T04:38:43Z
dc.date.issued2005-03-09T06:59:19Z
dc.date.submitted1999-08
dc.identifier.urihttp://etd.iisc.ac.in/handle/2005/79
dc.identifier.srnonull
dc.description.abstractWith the advent of Distributed Memory Machines (DMMs) numerous work have been undertaken to ease the work of a programmer these systems. Data parallel languages like Fortran D, Vienna Fortran, High Performance Fortran and C+ allow the user to specify data distribution across processor with some directives, and the compiler for these language use the directives to compile the programme in to an SPMD code. There are number of old program which are still in use and rewriting them in to new data parallel languages is a costly effort. Most of the work on these parallelizing compilers concentrate on efficient data communication between the processors.With the advancement in technology, data communication time is also decreasing.This allows bigger programs to execute in the same time span.The resources of a DMM being finite puts a limit on the size of the problem that can be run. Improving the memory usage for a problem will hence allow us run bigger size problems. Further, as communication speed increases, the overhead caused by house-keeping computations like global index to local index transformation, and owner processor computation will degrade the performance of the resultant code. Hence a uniform and efficient method for these computations also becomes a necessity. We have implemented parallelizing parts of a compiler using the SUIF compiler system, which accepts programs written in Fortran77 with directives to the compiler as comments. The output of the compiler is an SPMD C program, with embedded PVM calls for message communication between the processors. We have also proposed algorithms to improve data communications,and minimizing memory usage in the output code. A uniform method for performing owner processor computations and global-to-local transformations has also been implemented.en
dc.format.extent1044259 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.publisherIndian Institute of Scienceen
dc.rightsI 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.en
dc.subject.classificationComputer and Information Scienceen
dc.subject.keywordParallelizing Compileren
dc.subject.keywordFORTRAN Compileren
dc.subject.keywordDistributed Memory Machinesen
dc.titleA Parallelizing Compiler for Fortranen
dc.typeElectronic Thesis and Dissertationen
dc.degree.nameMSc Engg.en
dc.degree.levelMastersen
dc.degree.grantorIndian Institute of Scienceen
dc.degree.disciplineFaculty of Engineerngen


Files in this item

This item appears in the following Collection(s)

Show simple item record