Pipelining tree-structured algorithms on SIMD architectures
type: Item
instance of: scholarly article
title: Pipelining tree-structured algorithms on SIMD architectures
zbMATH Open document ID: 0697.68015
DOI: 10.1016/0020-0190(90)90110-J
published in: Information Processing Letters
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68N99
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4143412
zbMATH Keywords: SIMD architectures
zbMATH Keywords: pipelined architectures
zbMATH Keywords: processor allocation
zbMATH Keywords: divide-and-conquer
zbMATH Keywords: parallel algorithms
zbMATH Keywords: CRCW PRAM
zbMATH Keywords: algorithm complexity
author: David T. Barnard
author: D. B. Skillicorn
MaRDI profile type: Publication
cites work: Parallel parsing on the connection machine
cites work: A taxonomy of problems with fast parallel algorithms
Recommended article: Tree-based parallel algorithm design
Recommended article: Pipelining of computation schemes
Recommended article: Q3727399
Recommended article: A new efficient pipelined-systolic matrix-vector multiplication algorithm for a tree-structured machine
Recommended article: Scheduling tree dags on parallel architectures
Recommended article: Q4356981
Recommended article: On the power of the linear array architecture for performing tree- structured computations
description: scientific article; zbMATH DE number 4143412