L. Nyland and J. Prins. "Prototyping Parallel Algorithms," Proceedings of DAGS'92, Dartmouth College, Hanover, NH, June, 1992. Also available from anonymous ftp at cs.duke.edu as /pub/proteus/dags92.ps Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Practical Issues in the Flattening of Nested.. - Faith, Palmer, Prins, .. (1995) (Correct)
....the size of generated code. 2. The order in which the transformations are applied must avoid non terminating transformation loops. 3. The interaction between optimizations (e.g. common subexpression elimination) and code generation must be considered, so that optimal code is produced. In Proteus [3, 4], our high level, wide spectrum parallel programming language, all data parallelism is expressed using an apply to all iterator construct. Our transformation system compiles Proteus iterator constructs into C with calls to the Data Parallel Library (DPL) 5] which is built on the portable ....
Lars S. Nyland and Jan F. Prins. Prototyping parallel algorithms. Proceedings of 1992 DAGS/PC Symposium (Dartmount College, Hanover, NH, June 1992), pages 31--9, Donald Johnson, Fillia Makedon, and Panagiotis Metaxas, editors. Dartmouth College, 1992.
A Data-Parallel Implementation of the Adaptive Fast.. - Nyland, Prins, Reif (1993) (12 citations) Self-citation (Nyland Prins) (Correct)
No context found.
L. Nyland and J. Prins. "Prototyping Parallel Algorithms," Proceedings of DAGS'92, Dartmouth College, Hanover, NH, June, 1992. Also available from anonymous ftp at cs.duke.edu as /pub/proteus/dags92.ps
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