D. Suciu and V. Tannen. Efficient compilation of high-level data-parallel algorithms. In Proceedings of SPAA '94, 1994.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....work complexities of the source level metrics [9,5] However, overheads and space requirements in the realization of this model require careful run time scheduling [4] fast synchronization [25] and granularity control (in the sense of [10] to make it practical. Blelloch [1] and Suciu and Tannen [34,33], have presented nested parallel languages and have argued that these languages can be implemented on the VRAM with the correct step work complexity. However, these results are based on simulation techniques rather than explicit source to target translations. Skillicorn and Cai [31] presented a ....

D. Suciu and V. Tannen. Efficient compilation of high-level data parallel algorithms. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures. ACM Press, June 1994.

....work complexities of the source level metrics [9,5] However, overheads and space requirements in the realization of this model require careful run time scheduling [4] fast synchronization [25] and granularity control (in the sense of [10] to make it practical. Blelloch [1] and Suciu and Tannen [34,33], have presented nested parallel languages and have argued that these languages can be implemented on the VRAM with the correct step work complexity. However, these results are based on simulation techniques rather than explicit source to target translations. Skillicorn and Cai [31] presented a ....

D. Suciu and V. Tannen. Efficient compilation of high-level data parallel algorithms. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures. ACM Press, June 1994.

.... [9] and for region inference (see [24, 1] In areas like parallel programming, where efficiency is a paramount issue, good intermediate languages are even more critical to bridge the gap between high level languages (e.g. NESL) and efficient implementations on a variety of architectures (see [2, 3, 22]) However, in this area of computing intermediate languages (e.g. VCODE) have not made significant use of types, yet. This paper proposes a typed intermediate language S2 for vector languages, and shows how it may be used to extract useful information from programs written in the Nested Sequence ....

....area of computing intermediate languages (e.g. VCODE) have not made significant use of types, yet. This paper proposes a typed intermediate language S2 for vector languages, and shows how it may be used to extract useful information from programs written in the Nested Sequence Calculus NSC (see [22]) an idealized vector language very closed to NESL. For an efficient compilation of NSC (and similar languages) on parallel machines it is very important to know in advance the size of vectors (more generally the shape of data structures) We study two translations from the NSC to S2. The most ....

[Article contains additional citation context not shown here]

Dan Suciu and Val Tannen. Efficient compilation of high-level data parallel algorithms. In Proc. ACM Symposium on Parallel Algorithms and Architectures, June 1994.

.... [9] and for region inference (see [24, 1] In areas like parallel programming, where efficiency is a paramount issue, good intermediate languages are even more critical to bridge the gap between high level languages (e.g. NESL) and efficient implementations on a variety of architectures (see [2, 3, 22]) However in this area of computing, intermediate languages (e.g. VCODE) have not made significant use of types, yet. This paper proposes a typed intermediate language S2 for vector languages, and shows how it may be used to extract useful information from programs written in the Nested Sequence ....

....area of computing, intermediate languages (e.g. VCODE) have not made significant use of types, yet. This paper proposes a typed intermediate language S2 for vector languages, and shows how it may be used to extract useful information from programs written in the Nested Sequence Calculus NSC (see [22]) an idealized vector language very closed to NESL. For an efficient compilation of NSC (and similar languages) on parallel machines it is very important to know in advance the size of vectors (more generally the shape of data structures) We study two translations from NSC to S2. The most ....

[Article contains additional citation context not shown here]

D. Suciu and V. Tannen. Efficient compilation of high-level data parallel algorithms. In Proc. ACM Symposium on Parallel Algorithms and Architectures, June 1994.

....to a class of programs that are called contained. With this implementation, a contained Nesl program with W work and D depth runs in O(W=p D lg p) time on a p processor pram. Similar results where shown by Suciu and Tannen for a parallel language based on while loops and map recursion [ST94] Blelloch and Greiner [BG95] proved that the nested parallelism available in call by value functional languages can be mapped onto the pram with the same time bounds as given in this paper. This parallelism is limited to binary fanout. None of the above work considered space bounds, and the ....

Dan Suciu and Val Tannen. Efficient compilation of high-level data parallel algorithms. In Proc. 6th ACM Symp. on Parallel Algorithms and Architectures, pages 57--66, June 1994.

....limited to a subclass of nested parallel programs called contained programs. The technique was the basis for the original implementation of the Nesl programming language [BCH 94] Similar results where shown by Suciu and Tannen for a parallel language based on while loops and map recursion [ST94] Blelloch and Greiner [BG95] proved that the nested parallelism available in call by value functional languages can be mapped onto the crew pram with scan primitives with the same time bounds as given in this paper. This parallelism is limited to binary fanout. None of the above work considered ....

D. Suciu and V. Tannen. Efficient compilation of high-level data parallel algorithms. In Proc. 6th ACM Symp. on Parallel Algorithms and Architectures, pages 57--66, June 1994.

....languages onto the PRAM were considered by Blelloch [5] and in the definition of Nesl [6] but the time bounds are restricted to a class of program that are called contained. Similar results were shown by Suciu and Tannen for a parallel language based on while loops and map recursion [32]. Practical issues. The design of the intermediate language and machine were optimized to simplify the proofs rather than for practical considerations. Here we briefly discuss some modifications to make the implementation more practical without affecting the asymptotic bounds (although they ....

Dan Suciu and Val Tannen. Efficient compilation of high-level data parallel algorithms. In Proceedings 6th ACM Symposium on Parallel Algorithms and Architectures, pages 57--66, June 1994.

....multiprocessors [22, 2, 9, 72] the LogP model is simple enough to serve as a framework for the design and analysis of parallel algorithms [42] Our optimal algorithm for monotone communication is for the LogP model. Our previous work Some results in this work have been previously announced in [66] and [64] Moreover, this work can be seen as a materialization of the theoretical result in [65, 67] Indeed, we give there a characterization of NC in terms of a query language for sets featuring the monad constructs seen also here and divide and conquer recursion (dcr) and it is easy to see ....

Dan Suciu and Val Tannen. Efficient compilation of high-level data parallel algorithms. In Proceedings of 6th ACM SIGACT-SIGMOD-SIGART Symposium on Parallel Algorithms and Architectures, pages 57--66, June 1994.

No context found.

D. Suciu and V. Tannen. Efficient compilation of high-level data-parallel algorithms. In Proceedings of SPAA '94, 1994.

No context found.

D. Suciu and T.Tannen. Efficient Compilation of High-Level Data Parallel Algorithm. In Proc. of ACM Symposium on Parallel Algorithms and Architectures, June

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