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

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

Authors: 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

Recommendations

• Analysis of the fork-join queue
• Estimating completion time ratios of a fork-join barrier synchronization
• Mean sojourn times in two-queue fork-join systems: bounds and approximations
• The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds

zbMATH Keywords

massively parallel processing

Mathematics Subject Classification ID

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

Cited In (2)

• A closer look at multiple forking: leveraging (in)dependence for a tighter bound
• Fork-Join program response time on multiprocessors with exchangeable join

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)