Scheduling tree dags on parallel architectures
type: Item
instance of: scholarly article
title: Scheduling tree dags on parallel architectures
zbMATH Open document ID: 0843.68010
DOI: 10.1007/BF01961545
author: Yanyan Li
published in: Algorithmica
publication date: 1996-08-13T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68M99
zbMATH DE Number: 871313
zbMATH Keywords: tree decomposition
zbMATH Keywords: bounded degree forest dags
MaRDI profile type: Publication
cites work: Communication complexity of PRAMs
cites work: Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
cites work: Q4198056
cites work: On the power of the linear array architecture for performing tree- structured computations
cites work: A Communication-Time Tradeoff
cites work: Towards an Architecture-Independent Analysis of Parallel Algorithms
cites work: Q4893453
full work available at URL: https://doi.org/10.1007/bf01961545
OpenAlex ID: W2009081567
Recommended article: Q3678667
Recommended article: Q4537094
Recommended article: Scheduling task-trees with additive scales on parallel/distributed machines
Recommended article: Scheduling task-tree with additive scales on parallel/distributed machines
Recommended article: Tree-based parallel algorithm design
Recommended article: Parallel implementation of tree skeletons
Recommended article: Parallel algorithms for tree traversals
Recommended article: Parallel algorithms for tree accumulations
description: scientific article; zbMATH DE number 871313