Dave, Maulik A and Srikant, YN (1991) A parallelizing compiler for Pascal. In: Journal of the Indian Institute of Science, 71 (2). pp. 125-158.
Full text not available from this repository. (Request a copy)Abstract
A parallelizing compiler takes as its input a program in a sequential language such as FORTRAN or Pascal and after extracting parallelism which is implicit in it, generates code which is suitable for execution on a parallel processor. The authors have used Pascal for their compiler as it has extra features such as recursion, pointers, record structures and nesting of procedures. The aim is to extract the maximum parallelism in a reasonable time. Instead of flowgraphs, the concept of boxgraphs has been developed and implemented. An algorithm has been implemented to carry out simple and interprocedural dataflow analysis, array subscript analysis, to detect parallelism in boxgraphs and to convert them into boxgraphs depicting parallelism explicitly. The compiler generates code for the ORG Supermax machine, a shared memory multiprocessor with two 68020 processors running on the UNIX operating system V.3 (38 refs.)
| Item Type: | Journal Article |
|---|---|
| Publication: | Journal of the Indian Institute of Science |
| Publisher: | Indian Institute of Science |
| Additional Information: | Copyright of this article belongs to Indian Institute of Science. |
| Department/Centre: | Division of Electrical Sciences > Computer Science & Automation |
| Date Deposited: | 19 Oct 2006 |
| Last Modified: | 27 Aug 2008 12:23 |
| URI: | http://eprints.iisc.ac.in/id/eprint/8666 |
Actions (login required)
 |
View Item |
