research-article

Approximate Analysis of Fork/Join Synchronization in Parallel Queues

Authors:

R. Nelson,

A. N. TantawiAuthors Info & Claims

IEEE Transactions on Computers, Volume 37, Issue 6

Pages 739 - 743

https://doi.org/10.1109/12.2213

Published: 01 June 1988 Publication History

Publisher Site

Abstract

An approximation technique, called scaling approximation, is introduced and applied to the analysis of homogeneous fork/join queuing systems consisting of K or=32.

References

[1]

{1} F. Baccelli and A. M. Makowski, "Simple computable bounds for the fork-join queue," in Proc. John Hopkins Conf. Inf. Sci. , John Hopkins Univ., 1985.

Google Scholar

[2]

{2} R. E. Barlow and R. Proschan, Statistical Theory of Reliability and Life Testing . Holt, Reinhart and Winston, 1975.

Google Scholar

[3]

{3} L. Flatto and S. Hahn, "Two parallel queues created by arrivals with two demands I," SIAM J. Appl. Math. , vol. 44, pp. 1041-1053, Oct. 1984.

Crossref

Google Scholar

[4]

{4} L. Flatto, "Two parallel queues created by arrivals with two demands II," SIAM J. Appl. Math. , vol. 45, pp. 861-878, Oct. 1985.

Crossref

Google Scholar

[5]

{5} P. Heidelberger and K. S. Trivedi, "Queueing network models for parallel processing with asynchronous tasks," IEEE Trans. Comput. , vol. C-31, pp. 1099-1109, Nov. 1982.

Google Scholar

[6]

{6} P. Heidelberger and K. S. Trivedi, "Analytic queueing models for programs with internal concurrency," IEEE Trans. Comput. , vol. C-32, pp. 73-82, Jan. 1983.

Google Scholar

[7]

{7} L. Kleinrock, Queueing Systems, Vol. 1: Theory . New York: Wiley, 1975.

Crossref

Google Scholar

[8]

{8} R. D. Nelson and B. R. Iyer, "Analysis of a replicated data base," Perform. Eval. , vol. 5, pp. 133-148, Aug. 1985.

Digital Library

Google Scholar

Cited By

View all

Dobre RNiu ZCasale GBalsamo SKnottenbelt WAbad CShang W(2024)Approximating Fork-Join Systems via Mixed Model TransformationsCompanion of the 15th ACM/SPEC International Conference on Performance Engineering10.1145/3629527.3652277(273-280)Online publication date: 7-May-2024
https://dl.acm.org/doi/10.1145/3629527.3652277
Carmeli NYom-Tov GBoxma O(2023)State-Dependent Estimation of Delay Distributions in Fork-Join NetworksManufacturing & Service Operations Management10.1287/msom.2022.116725:3(1081-1098)Online publication date: 1-May-2023
https://dl.acm.org/doi/10.1287/msom.2022.1167
Gorbunova ALebedev A(2023)Nonlinear approximation of characteristics of a fork–join queueing system with Pareto service as a model of parallel structure of data processingMathematics and Computers in Simulation10.1016/j.matcom.2023.07.029214:C(409-428)Online publication date: 1-Dec-2023
https://dl.acm.org/doi/10.1016/j.matcom.2023.07.029
Show More Cited By

Index Terms

Approximate Analysis of Fork/Join Synchronization in Parallel Queues

Recommendations

A Hybrid Solution of Fork/Join Synchronization in Parallel Queues

A new analysis technique, dynamic-bubblesort analysis, is introduced for general K-queue first-in-first-out HFJ (homogenous fork/join queuing) systems of $K \geq 2$. The dynamic-bubblesort model dynamically sorts the branches of the queues based on the ...
Analysis of the Fork-Join Queue

A fork-join queue is considered as a typical model of parallel processing systems with arrival and departure synchronizations. An approach for obtaining the transient and the steady-state solutions of the fork-join queue in terms of the virtual waiting ...
Analysis of a dynamic assignment of impatient customers to parallel queues

Consider a number of parallel queues, each with an arbitrary capacity and multiple identical exponential servers. The service discipline in each queue is first-come-first-served (FCFS). Customers arrive according to a state-dependent Poisson process. ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Computers

IEEE Transactions on Computers Volume 37, Issue 6

June 1988

136 pages

ISSN:0018-9340

Editor:
Bruce D. Shriver

Issue’s Table of Contents

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 June 1988

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

103
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 29 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Dobre RNiu ZCasale GBalsamo SKnottenbelt WAbad CShang W(2024)Approximating Fork-Join Systems via Mixed Model TransformationsCompanion of the 15th ACM/SPEC International Conference on Performance Engineering10.1145/3629527.3652277(273-280)Online publication date: 7-May-2024
https://dl.acm.org/doi/10.1145/3629527.3652277
Carmeli NYom-Tov GBoxma O(2023)State-Dependent Estimation of Delay Distributions in Fork-Join NetworksManufacturing & Service Operations Management10.1287/msom.2022.116725:3(1081-1098)Online publication date: 1-May-2023
https://dl.acm.org/doi/10.1287/msom.2022.1167
Gorbunova ALebedev A(2023)Nonlinear approximation of characteristics of a fork–join queueing system with Pareto service as a model of parallel structure of data processingMathematics and Computers in Simulation10.1016/j.matcom.2023.07.029214:C(409-428)Online publication date: 1-Dec-2023
https://dl.acm.org/doi/10.1016/j.matcom.2023.07.029
Schol DVlasiou MZwart B(2022)Large Fork-Join Queues with Nearly Deterministic Arrival and Service TimesMathematics of Operations Research10.1287/moor.2021.117147:2(1335-1364)Online publication date: 1-May-2022
https://dl.acm.org/doi/10.1287/moor.2021.1171
Walker BBora SFidler M(2022)Performance and Scaling of Parallel Systems with Blocking Start and/or Departure BarriersIEEE INFOCOM 2022 - IEEE Conference on Computer Communications10.1109/INFOCOM48880.2022.9796754(460-469)Online publication date: 2-May-2022
https://dl.acm.org/doi/10.1109/INFOCOM48880.2022.9796754
Raaijmakers YBorst SBoxma O(2022)Fork–join and redundancy systems with heavy-tailed job sizesQueueing Systems: Theory and Applications10.1007/s11134-022-09856-6103:1-2(131-159)Online publication date: 1-Sep-2022
https://dl.acm.org/doi/10.1007/s11134-022-09856-6
Gorbunova AVishnevsky V(2022)On Estimating the Average Response Time of High-Performance Computing EnvironmentsDistributed Computer and Communication Networks: Control, Computation, Communications10.1007/978-3-031-23207-7_29(371-384)Online publication date: 26-Sep-2022
https://dl.acm.org/doi/10.1007/978-3-031-23207-7_29
Cheng WRen FJiang WZhang T(2021)Optimizing the Response Time of Memcached Systems via Model and Quantitative AnalysisIEEE Transactions on Computers10.1109/TC.2020.301161970:9(1458-1471)Online publication date: 1-Sep-2021
https://dl.acm.org/doi/10.1109/TC.2020.3011619
Fidler MJiang Y(2021)Non-asymptotic delay bounds for (k, l) fork-join systems and multi-stage fork-join networksIEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications10.1109/INFOCOM.2016.7524362(1-9)Online publication date: 10-Mar-2021
https://dl.acm.org/doi/10.1109/INFOCOM.2016.7524362
Harchol-Balter M(2021)Open problems in queueing theory inspired by datacenter computingQueueing Systems: Theory and Applications10.1007/s11134-020-09684-697:1-2(3-37)Online publication date: 27-Jan-2021
https://dl.acm.org/doi/10.1007/s11134-020-09684-6
Show More Cited By

Abstract

References

Cited By

Index Terms

Recommendations

A Hybrid Solution of Fork/Join Synchronization in Parallel Queues

Analysis of the Fork-Join Queue

Analysis of a dynamic assignment of impatient customers to parallel queues

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations