Results 11  20
of
252
Powerlist: a structure for parallel recursion
 ACM Transactions on Programming Languages and Systems
, 1994
"... Many data parallel algorithms – Fast Fourier Transform, Batcher’s sorting schemes and prefixsum – exhibit recursive structure. We propose a data structure, powerlist, that permits succinct descriptions of such algorithms, highlighting the roles of both parallelism and recursion. Simple algebraic pro ..."
Abstract

Cited by 62 (2 self)
 Add to MetaCart
(Show Context)
Many data parallel algorithms – Fast Fourier Transform, Batcher’s sorting schemes and prefixsum – exhibit recursive structure. We propose a data structure, powerlist, that permits succinct descriptions of such algorithms, highlighting the roles of both parallelism and recursion. Simple algebraic properties of this data structure can be exploited to derive properties of these algorithms and establish equivalence of different algorithms that solve the same problem.
CollectionOriented Languages
 PROCEEDINGS OF THE IEEE
, 1991
"... Several programming languages arising from widely diverse practical and theoretical considerations share a common highlevel feature: their basic data type is an aggregate of other more primitive data types and their primitive functions operate on these aggregates. Examples of such languages (and th ..."
Abstract

Cited by 60 (5 self)
 Add to MetaCart
(Show Context)
Several programming languages arising from widely diverse practical and theoretical considerations share a common highlevel feature: their basic data type is an aggregate of other more primitive data types and their primitive functions operate on these aggregates. Examples of such languages (and the collections they support) are FORTRAN 90 (arrays), APL (arrays), Connection Machine LISP (xectors), PARALATION LISP (paralations), and SETL (sets). Acting on large collections of data with a single operation is the hallmark of dataparallel programming and massively parallel computers. These languages  which we call collectionoriented  are thus ideal for use with massively parallel machines, even though many of them were developed before parallelism and associated considerations became important. This paper examines collections and the operations that can be performed on them in a languageindependent manner. It also critically reviews and compares a variety of collectionoriented languages...
Single Assignment C  efficient support for highlevel array operations in a functional setting
, 2003
"... ..."
Transforming HighLevel DataParallel Programs into Vector Operations
 Proceedings Principles and Practices of Parallel Programming 93, ACM
, 1993
"... Fullyparallel execution of a highlevel dataparallel language based on nested sequences, higher order functions and generalized iterators can be realized in the vector model using a suitable representation of nested sequences and a small set of transformational rules to distribute iterators throug ..."
Abstract

Cited by 53 (21 self)
 Add to MetaCart
(Show Context)
Fullyparallel execution of a highlevel dataparallel language based on nested sequences, higher order functions and generalized iterators can be realized in the vector model using a suitable representation of nested sequences and a small set of transformational rules to distribute iterators through the constructs of the language. 1.
A Database Array Algebra for SpatioTemporal Data and Beyond
 In Next Generation Information Technologies and Systems
, 1999
"... . Recently multidimensional arrays have received considerable attention among the database community, applications ranging from GIS to OLAP. Work on the formalization of arrays frequently focuses on mapping sparse arrays to ROLAP schemata. Database modeling of further array types, such as image data ..."
Abstract

Cited by 42 (15 self)
 Add to MetaCart
(Show Context)
. Recently multidimensional arrays have received considerable attention among the database community, applications ranging from GIS to OLAP. Work on the formalization of arrays frequently focuses on mapping sparse arrays to ROLAP schemata. Database modeling of further array types, such as image data, is done differently and with less rigid methods. A unifying formal framework for general array handling of image, sensor, statistics, and OLAP data is missing. We present a crossdimensional and applicationindependent algebra for the highlevel treatment of arbitrary arrays. An array constructor, a generalized aggregate, plus a multidimensional sorter allow to declaratively manipulate arrays. This algebra forms the conceptual basis of a domainindependent array DBMS, RasDaMan, which offers an SQLbased query language with extensive algebraic query and storage optimization. The system is in practical use in neuro science. We introduce the algebra and show how the operators transform to the...
Scan Primitives for Vector Computers
 In Proceedings Supercomputing '90
, 1990
"... This paper describes an optimized implementation of a set of scan (also called allprefix sums) primitives on a single processor of a CRAY YMP, and demonstrates that their use leads to greatly improved performance for several applications that cannot be vectorized with existing compiler technology. ..."
Abstract

Cited by 40 (9 self)
 Add to MetaCart
(Show Context)
This paper describes an optimized implementation of a set of scan (also called allprefix sums) primitives on a single processor of a CRAY YMP, and demonstrates that their use leads to greatly improved performance for several applications that cannot be vectorized with existing compiler technology. The algorithm used to implement the scans is based on an algorithm for parallel computers and is applicable with minor modifications to any registerbased vector computer. On the CRAY YMP, the asymptotic running time of the plusscan is about 2.25 times that of a vector add, and is within 20% of optimal. An important aspect of our implementation is that a set of segmented versions of these scans are only marginally more expensive than the unsegmented versions. These segmented versions can be used to execute a scan on multiple data sets without having to pay the vector startup cost (n 1=2 ) for each set. The paper describes a radix sorting routine based on the scans that is 13 times faster ...