Parallel range minima on coarse grained multicomputers

DOI10.1142/S0129054199000277zbMATH Open1319.68247OpenAlexW2029882434MaRDI QIDQ5249012FDOQ5249012

Authors: H. Mongelli, Siang W. Song 

Publication date: 29 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054199000277

Recommendations

• Constant-time RMESH algorithms for the range minima and co-minima problems
• Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains
• Randomized range-maxima in nearly-constant parallel time
• Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs
• Efficient parallel graph algorithms for coarse-grained multicomputers and BSP

zbMATH Keywords

parallel algorithmslowest common ancestorcoarse grainded multicomputerrange minima

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Graph algorithms (graph-theoretic aspects) (05C85) Parallel algorithms in computer science (68W10) Numerical algorithms for specific classes of architectures (65Y10)

Cites Work

• Recursive Star-Tree Parallel Data Structure
• Fast Algorithms for Finding Nearest Common Ancestors
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• A unifying look at data structures
• Efficient pattern matching with scaling
• Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
• Efficient parallel graph algorithms for coarse grained multicomputers and BSP

Cited In (1)

• An efficient coarse-grained parallel algorithm for global-local multiscale computations on massively parallel systems

This page was built for publication: Parallel range minima on coarse grained multicomputers

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