More general parallel tree contraction: register allocation and broadcasting in a tree

DOI10.1007/3-540-62559-3_12zbMATH Open1539.68218MaRDI QIDQ6550540

Krzysztof Diks, Torben Hagerup

Publication date: 5 June 2024

zbMATH Keywords

parallel algorithmsbroadcastingregister allocationtree contraction

Mathematics Subject Classification ID

Trees (05C05) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Cites Work

• Title not available (Why is that?)
• On parallel integer merging
• An Efficient Parallel Biconnectivity Algorithm
• Deterministic coin tossing with applications to optimal parallel list ranking
• Parallel Merge Sort
• Relations between Concurrent-Write Models of Parallel Computation
• Information Dissemination in Trees
• Parallel Tree Contraction Part 2: Further Applications
• Complete Register Allocation Problems
• A simple parallel tree contraction algorithm
• Prefix graphs and their applications

This page was built for publication: More general parallel tree contraction: register allocation and broadcasting in a tree

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