K. Kennedy, H.P. Zima, "Virtual Shaped Memory for Distributed-Memory Machines," Proceedings of the Fourth Hypercube Conference, Monterey, California, March 1989, 6 pp.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....changes may require major program restructuring. An alternative approach is to automatically generate parallel programs in SPMD (Single Program Multiple Data) Karp87] format, given a data decomposition specification. This approach has recently gained a lot of attention. It has been applied by [Callahan88, Gerndt89, Kennedy89,90] for applications to Fortran, by [Andre90] to C, by [Rogers89] to Id Nouveau, by [Koelbel90] to Kali Fortran, by [Quinn89] to C , and by [Paalvast90] to the fourth generation parallel programming language Booster. In particular application to Fortran shows some limitations, due to equivalencing, ....

....shows some limitations, due to equivalencing, passing of array subsections to subroutine calls, etc. A second limitation is that the description of complex decompositions and especially dynamic decompositions, i.e. a redistribution of the data at run time, is not feasible either. An exception is [Kennedy89] where a method is presented to describe redistribution. However, this method still has the drawback that redistribution statements are not generated automatically and are intermingled with the program code, which limits portability. A more fundamental problem to these approaches is that ....

K. Kennedy, H.P. Zima, "Virtual Shaped Memory for Distributed-Memory Machines," Proceedings of the Fourth Hypercube Conference, Monterey, California, March 1989, 6 pp.

....This insight has led to the approach of parallelism through program annotations, incorporating explicit data decompositions. From these data decomposition specifications, SPMD (Single Process Multiple Data) code [Karp87] can be generated automatically. This approach is followed by [Callahan88, Gerndt89, Kennedy89, 4 Koelbel89] in FORTRAN, by [Rogers89] in Id Nouveau, and by [Quinn89] in C . This concept is also followed in Booster [Paalvast90] 3. Booster Language concepts Booster is a high level, fourth generation, algorithm description language for sequential and parallel computers. Parallel computers may be either ....

K. Kennedy, H.P. Zima, "Virtual Shaped Memory for Distributed-Memory Machines," Proceedings of the Fourth Hypercube Conference, Monterey, California, March 1989, 6 pp.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC