Realizing the parallelism of array-based computation

DOI10.1016/0167-8191(89)90075-6zbMATH Open0673.68024OpenAlexW2069715994MaRDI QIDQ1121012FDOQ1121012

Authors Carl McCrosky 

Publication date 1989

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(89)90075-6

zbMATH Keywords

SIMD architectureArray-based computationimplementation of array operationsrelationship of communications and parallelism

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Theory of software (68N99) Theory of operating systems (68N25)

Recommendations

• Array processing machines: an abstract model
• scientific article; zbMATH DE number 4064454
• scientific article; zbMATH DE number 3917713
• scientific article; zbMATH DE number 578414
• Exploiting fine-grain parallelism on dataflow architectures

Cited in

(11)

• scientific article; zbMATH DE number 3917713 (Why is no real title available?)
• Reasoning about data-parallel array assignment
• Parallel scheduling of recursively defined arrays: Revisited
• On the virtual array concept for higher order array processing
• On high-speed computing with a programmable linear array
• A compositional framework for developing parallel programs on two-dimensional arrays
• On the promise of general-purpose parallel computing
• A calculus for parallel computations over multidimensional dense arrays
• Maximum Pipelining Of Array Computation: A Pipelined Code Mapping Scheme For Dataflow Computers
• Gallop: The benefits of wide-area computing for parallel processing
• Array control for high-performance SIMD systems

This page was built for publication: Realizing the parallelism of array-based computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121012)