Pipelining tree-structured algorithms on SIMD architectures

DOI10.1016/0020-0190(90)90110-JMaRDI QIDQ911739zbMATH OpenFDO

Authors David T. Barnard, D. B. Skillicorn

Publication date 1990

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

parallel algorithmsalgorithm complexitydivide-and-conquerCRCW PRAMpipelined architecturesprocessor allocationSIMD architectures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of software (68N99)

Recommendations

• Tree-based parallel algorithm design
• Pipelining of computation schemes
• scientific article; zbMATH DE number 3958748
• A new efficient pipelined-systolic matrix-vector multiplication algorithm for a tree-structured machine
• Scheduling tree dags on parallel architectures
• scientific article; zbMATH DE number 1070487
• On the power of the linear array architecture for performing tree- structured computations

Cites work

• A taxonomy of problems with fast parallel algorithms
• Parallel parsing on the connection machine

Cited in

(1)

• Pipeline architectures for dynamic programming algorithms

This page was built for publication: Pipelining tree-structured algorithms on SIMD architectures

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