A VLSI implementation of an architecture for applicative programming
Future Generation Computer Systems
The design and analysis of parallel algorithms
The design and analysis of parallel algorithms
The technology of parallel processing: parallel processing architectures and VLSI hardware (vol. 1)
The technology of parallel processing: parallel processing architectures and VLSI hardware (vol. 1)
The connection machine
Scans as Primitive Parallel Operations
IEEE Transactions on Computers
Vector models for data-parallel computing
Vector models for data-parallel computing
Data-parallel programming on MIMD computers
Data-parallel programming on MIMD computers
The network architecture of the Connection Machine CM-5 (extended abstract)
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Highly parallel computing
Emerging trends in database and knowledge-base machines
Programming parallel algorithms
Communications of the ACM
Practical parallel programming
Practical parallel programming
Models and languages for parallel computation
ACM Computing Surveys (CSUR)
Journal of the ACM (JACM)
A Transformation Approach to Derive Efficient Parallel Implementations
IEEE Transactions on Software Engineering - Special issue on architecture-independent languages and software tools parallel processing
Mixing buffers and pass transistors in FPGA routing architectures
FPGA '01 Proceedings of the 2001 ACM/SIGDA ninth international symposium on Field programmable gate arrays
Reconfigurable computing: a survey of systems and software
ACM Computing Surveys (CSUR)
Models of Computation: Exploring the Power of Computing
Models of Computation: Exploring the Power of Computing
Associative Computing: A Programming Paradigm for Massively Parallel Computers
Associative Computing: A Programming Paradigm for Massively Parallel Computers
Parallel Sorting Algorithms
The Massively Parallel Processor
The Massively Parallel Processor
Computer Architecture and Parallel Processing
Computer Architecture and Parallel Processing
Approaches for Integrating Task and Data Parallelism
IEEE Concurrency
Data sharing in an FFP machine
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
X-Tree: A tree structured multi-processor computer architecture
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
Copying operands versus copying results: A solution to the problem of large operands in FFP'S
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
A systolic associative lisp computer architecture with incremental parallel storage management
A systolic associative lisp computer architecture with incremental parallel storage management
Journal of Functional Programming
Hi-index | 0.00 |
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.