Parallel algorithms for tree accumulations

DOI10.1016/J.JPDC.2004.09.001MaRDI QIDQ2485129zbMATH OpenOpenAlexFDO

Authors Fatih E. Sevilgen, Srinivas Aluru, Natsuhiko Futamura

Publication date 3 August 2005

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2004.09.001

zbMATH Keywords

Parallel prefixTree contractionDownward accumulationUpward accumulation

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Computing downwards accumulations on trees quickly
• scientific article; zbMATH DE number 512952
• Optimal computation of prefix sums on a binary tree of processors
• Parallel implementation of tree skeletons
• Communication-efficient parallel algorithms for distributed random-access machines

Cited in

(15)

• Constructing Huffman Trees in Parallel
• Parallel matrix product algorithm in the de Bruijn network using emulation of meshes of trees
• Parallelizing computation of expected values in recombinant binomial trees
• Tree-based parallel algorithm design
• A unified approach to parallel depth-first traversals of general trees
• Parallel computation of matchings in trees
• Parallel computations on a graph
• Efficient parallel algorithms for some tree layout problems
• scientific article; zbMATH DE number 5942279 (Why is no real title available?)
• OPTIMAL PARALLEL ENCODING AND DECODING ALGORITHMS FOR TREES
• scientific article; zbMATH DE number 1555968 (Why is no real title available?)
• Scheduling tree dags on parallel architectures
• The characterization of data-accumulating algorithms
• A parallel tree difference algorithm
• scientific article; zbMATH DE number 3876584 (Why is no real title available?)

This page was built for publication: Parallel algorithms for tree accumulations

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