Bounds and Approximations for Overheads in the Time to Join Parallel Forks

DOI10.1287/IJOC.7.2.125zbMATH Open0858.68039OpenAlexW1970134260MaRDI QIDQ4896441

Peter Downey

Publication date: 31 March 1997

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4ea582ed6a9c6852d6805af55977dc3d279e854a

zbMATH Keywords

massively parallel processing

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (1)

A closer look at multiple forking: leveraging (in)dependence for a tighter bound

This page was built for publication: Bounds and Approximations for Overheads in the Time to Join Parallel Forks

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