{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T15:29:42Z","timestamp":1759937382265,"version":"3.41.0"},"reference-count":31,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T00:00:00Z","timestamp":1580774400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Model. Perform. Eval. Comput. Syst."],"published-print":{"date-parts":[[2020,3,31]]},"abstract":"<jats:p>\n            &lt;?tight?&gt;Fork-join systems play a pivotal role in the analysis of distributed systems, telecommunication infrastructures, and storage systems. In this article, we consider a fork-join system consisting of\n            <jats:italic>K<\/jats:italic>\n            parallel servers, each of which works on one of the\n            <jats:italic>K<\/jats:italic>\n            tasks that form each job. The system allocates a fixed amount of computational resources among the\n            <jats:italic>K<\/jats:italic>\n            servers, hence determining their service speed. The goal of this article is that of studying the resource allocation policies among the servers. We assume that the queueing disciplines of the fork- and join-queues are First Come First Served. At each epoch, at most\n            <jats:italic>K<\/jats:italic>\n            tasks are in service while the others wait in the fork-queues. We propose an algorithm with a very simple implementation that allocates the computational resources in a way that aims at minimizing the join-queue lengths, and hence at reducing&lt;?brk?&gt; the expected job service time. We study its performance in saturation and under exponential service time. The model has an elegant closed-form stationary distribution. Moreover, we provide an algorithm to numerically or symbolically derive the marginal probabilities for the join-queue lengths. Therefore, the expressions for the expected join-queue length and the expected response time under immediate join can be derived. Finally, we compare the performance of the proposed resource allocation algorithm with that of other strategies.\n          <\/jats:p>","DOI":"10.1145\/3372376","type":"journal-article","created":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T13:41:04Z","timestamp":1585921264000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Dynamic Resource Allocation in Fork-Join Queues"],"prefix":"10.1145","volume":"5","author":[{"given":"Andrea","family":"Marin","sequence":"first","affiliation":[{"name":"Universit\u00e0 Ca\u2019 Foscari Venezia, Venezia, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sabina","family":"Rossi","sequence":"additional","affiliation":[{"name":"Universit\u00e0 Ca\u2019 Foscari Venezia, Venezia, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matteo","family":"Sottana","sequence":"additional","affiliation":[{"name":"Universit\u00e0 Ca\u2019 Foscari Venezia, Venezia, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,2,4]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-006-7586-8"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/77600.77622"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/65950.65957"},{"volume-title":"Proceedings of International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS\u201914)","author":"Block R.","key":"e_1_2_1_4_1"},{"key":"e_1_2_1_5_1","first-page":"1","article-title":"Insensitivity in processor-sharing networks","volume":"49","author":"Bondald T.","year":"2002","journal-title":"Performance Evaluation"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2014.07.018"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2825236.2825257"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0144074"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01016412"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1988.0043"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177005427"},{"volume-title":"Reversibility and Stochastic Networks","author":"Kelly F.","key":"e_1_2_1_12_1"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/321386.321388"},{"volume-title":"Queueing Systems","author":"Kleinrock L.","key":"e_1_2_1_14_1"},{"key":"e_1_2_1_15_1","unstructured":"E. D. Lazowska J. L. Zahorjan G. S. Graham and K. C. Sevcick. 1984. Quantitative System Performance: Computer System Analysis Using Queueing Network Models. Prentice Hall Englewood Cliffs NJ.  E. D. Lazowska J. L. Zahorjan G. S. Graham and K. C. Sevcick. 1984. Quantitative System Performance: Computer System Analysis Using Queueing Network Models. Prentice Hall Englewood Cliffs NJ."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2017.04.005"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-016-0266-1"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2017.08.008"},{"volume-title":"Proceedings of Quantitative Evaluation of Systems (QEST\u201918)","author":"Marin A.","key":"e_1_2_1_19_1"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.2213"},{"key":"e_1_2_1_21_1","unstructured":"F. W. Olver D. W. Lozier R. F. Boisvert and C. W. Clark. 2010. NIST Handbook of Mathematical Functions (1st ed.). Cambridge University Press New York NY.  F. W. Olver D. W. Lozier R. F. Boisvert and C. W. Clark. 2010. NIST Handbook of Mathematical Functions (1st ed.). Cambridge University Press New York NY."},{"volume-title":"Proceedings of IEEE Conference on Computer Communications (INFOCOM\u201900)","author":"Pan R.","key":"e_1_2_1_22_1"},{"volume-title":"Proceedings of the International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS\u201917)","author":"Pesu T.","key":"e_1_2_1_23_1"},{"volume-title":"Proceedings of the International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS\u201916)","author":"Pesu T.","key":"e_1_2_1_24_1"},{"volume-title":"Proceedings of Annual Conference on Information Sciences and Systems (CISS\u201908)","author":"Rajagopalan S.","key":"e_1_2_1_25_1"},{"volume-title":"Proceedings of the International Joint Conferences on Measurement and Modeling of Computer Systems (ACM SIGMETRICS\/IFIP Performance\u201909)","author":"Rajagopalan S.","key":"e_1_2_1_26_1"},{"volume-title":"Proceedings of International Conference on Measurement and Modeling of Computer Systems (ACM SIGMETRICS\u201915)","author":"Rizk A.","key":"e_1_2_1_27_1"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-016-9486-x"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-014-1560-3"},{"volume-title":"Systems in Stochastic Equilibrium","author":"Whittle P.","key":"e_1_2_1_30_1"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.2307\/1427722"}],"container-title":["ACM Transactions on Modeling and Performance Evaluation of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372376","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3372376","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:21Z","timestamp":1750197741000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372376"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,4]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,3,31]]}},"alternative-id":["10.1145\/3372376"],"URL":"https:\/\/doi.org\/10.1145\/3372376","relation":{},"ISSN":["2376-3639","2376-3647"],"issn-type":[{"type":"print","value":"2376-3639"},{"type":"electronic","value":"2376-3647"}],"subject":[],"published":{"date-parts":[[2020,2,4]]},"assertion":[{"value":"2019-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-02-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}