Fork-Join program response time on multiprocessors with exchangeable join

DOI10.1631/JZUS.2006.A0927MaRDI QIDQ2508216zbMATH OpenOpenAlexFDO

Authors Yongcai Wang, Qianchuan Zhao, Dazhong Zheng

Publication date 9 October 2006

Published in Journal of Zhejiang University. Science A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1631/jzus.2006.a0927

zbMATH Keywords

response timemultiprocessorfirst come first served (FCFS)exchangeable joinFork-Join

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)

Recommendations

• Analysis of the fork-join queue
• Biased Processor Sharing in Fork-Join Queues
• Response times in M/M/s fork-join networks
• Bounds and Approximations for Overheads in the Time to Join Parallel Forks
• A performance evaluation of several priority policies for parallel processing systems

Cites work

• scientific article; zbMATH DE number 50893 (Why is no real title available?)
• On the execution of parallel programs on multiprocessor systems—a queuing theory approach
• Response times in M/M/s fork-join networks
• Sample-path analysis of queueing systems
• Some Guidelines and Guarantees for Common Random Numbers
• Two Parallel Queues Created by Arrivals with Two Demands I
• Two Parallel Queues Created by Arrivals with Two Demands II
• Two parallel processors with coupled inputs

Cited in

(1)

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

This page was built for publication: Fork-Join program response time on multiprocessors with exchangeable join

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