Efficient parallel graph algorithms for coarse grained multicomputers and BSP

DOI10.1007/3-540-63165-8_195MaRDI QIDQ4571970zbMATH OpenOpenAlexFDO

Authors Frank Dehne, Ingo Rieping, Alessandro Roncato, Siang W. Song, E. Cáceres, Afonso G. Ferreira, P. Flocchini, N. Santoro

Publication date 4 July 2018

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-63165-8_195

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Parallel algorithms in computer science (68W10)

Recommendations

• Efficient parallel graph algorithms for coarse-grained multicomputers and BSP
• Graph algorithms with small communication costs
• Euro-Par 2004 Parallel Processing
• Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
• Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms

Cites work

• Algorithmic Aspects of Vertex Elimination on Graphs
• An Efficient Parallel Biconnectivity Algorithm
• An O(logn) parallel connectivity algorithm
• Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
• Direct bulk-synchronous parallel algorithms
• Efficient parallel graph algorithms for coarse grained multicomputers and BSP
• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• scientific article; zbMATH DE number 1256741 (Why is no real title available?)
• scientific article; zbMATH DE number 1142307 (Why is no real title available?)
• scientific article; zbMATH DE number 1555985 (Why is no real title available?)
• On rigid circuit graphs
• Parallel ear decomposition search (EDS) and st-numbering in graphs
• Parallel Merge Sort
• Randomized parallel list ranking for distributed memory multiprocessors.
• Scalable 2D convex hull and triangulation algorithms for coarse grained multicomputers
• SCALABLE PARALLEL COMPUTATIONAL GEOMETRY FOR COARSE GRAINED MULTICOMPUTERS

Cited in

(11)

• 1-optimality of static BSP computations: Scheduling independent chains as a case study.
• Emulations between QSM, BSP and LogP: A framework for general-purpose parallel algorithm design.
• Graph algorithms with small communication costs
• Efficient parallel graph algorithms for coarse-grained multicomputers and BSP
• \texttt{mplrs}: a scalable parallel vertex/facet enumeration code
• scientific article; zbMATH DE number 1696524 (Why is no real title available?)
• Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique
• Efficient parallel graph algorithms for coarse grained multicomputers and BSP
• Parallel range minima on coarse grained multicomputers
• Euro-Par 2004 Parallel Processing
• Efficient parallel algorithms for doubly convex-bipartite graphs

This page was built for publication: Efficient parallel graph algorithms for coarse grained multicomputers and BSP

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