Communications of the ACM - Special issue on parallelism
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
The definition of Standard ML
Data optimization: allocation of arrays to reduce communication on SIMD machines
Journal of Parallel and Distributed Computing - Massively parallel computation
Compiling collection-oriented languages onto massively parallel computers
Journal of Parallel and Distributed Computing - Massively parallel computation
Vector models for data-parallel computing
Vector models for data-parallel computing
Logical and computational aspects of programming with sets/bags/lists
Proceedings of the 18th international colloquium on Automata, languages and programming
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
An introduction to parallel algorithms
An introduction to parallel algorithms
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Naturally Embedded Query Languages
ICDT '92 Proceedings of the 4th International Conference on Database Theory
NESL: A Nested Data-Parallel Language (Version 2.6)
NESL: A Nested Data-Parallel Language (Version 2.6)
Provably efficient scheduling for languages with fine-grained parallelism
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
A provable time and space efficient implementation of NESL
Proceedings of the first ACM SIGPLAN international conference on Functional programming
Provably efficient scheduling for languages with fine-grained parallelism
Journal of the ACM (JACM)
Implementation and Analysis of a Parallel Collection Query Language
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Parallel functional programming on recursively defined data via data-parallel recursion
Journal of Functional Programming
Adaptive scheduling with parallelism feedback
Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming
| Hi-index | 0.00 |
We present a high-level parallel calculus for nested sequences, NSC , offered as a possible theoretical “core” of an entire class of collection-oriented parallel languages. NSC is based on while-loops as opposed to general recursion. A formal, machine independent definition of the parallel time complexity and the work complexity of programs in NSC is given. Our main results are: (1) We give a translation method for a particular form of recursion, called map-recursion, into NSC , that preserves the time complexity and adds an arbitrarily small overhead to the work complexity, and (2) We give a compilation method for NSC into a very simple vector parallel machine, which preserves the time complexity and again adds an arbitrarily small overhead to the work complexity.