A VLSI implementation of an architecture for applicative programming

O'Donnell, John T.; Bridges, Todd Arthur; Kitchel, S. W.

doi:10.1016/0167-739x(88)90008-8

Cited by 6 publications

(3 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, another alternative is feasible. The abstract tree can be built as a physical tree using VLSI combinational logic for the nodes [14]. This approach is especially appropriate if the leaf processors are also custom VLSI or configurable hardware.…”

Section: Methodsmentioning

confidence: 99%

“…To show how the quicksort algorithm proceeds, an execution is sketched using the sample data [13,15,10,12,14,11].…”

Section: A Data Parallel Quicksortmentioning

confidence: 99%

“…One example of this approach is a parallel string reduction machine [13], [25], intended for implementing the functional language FFP. A related system is APSA [14], which uses parallelism within the tree to provide data structure operations useful in the implementation of list processing languages such as Lisp and Scheme.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Supporting tasks with adaptive groups in data parallel programming

O'Donnell

2005

IJCSE

View full text Add to dashboard Cite

A set of communication operations is defined which allows a form of task parallelism to be achieved in a data parallel architecture. The set of processors can be subdivided recursively into groups, and a communication operation inside a group never conflicts with communications taking place in other groups. The groups may be subdivided and recombined at any time, allowing the task structure to adapt to the needs of the data. The algorithms implementing the grouping and communications are defined using parallel scans and folds which can be executed efficiently in an abstract tree machine. This approach is best suited for massively parallel systems with fine grain processors.

show abstract

Section: Methodsmentioning

confidence: 99%

“…To show how the quicksort algorithm proceeds, an execution is sketched using the sample data [13,15,10,12,14,11].…”

Section: A Data Parallel Quicksortmentioning

confidence: 99%