NDLI: Mean sojourn times in two-queue fork-join systems: bounds and approximations

Content Provider	Springer Nature Link
Author	Kemper, Benjamin Mandjes, Michel
Copyright Year	2011
Abstract	This paper considers a fork-join system (or: parallel queue), which is a two-queue network in which any arrival generates jobs at both queues and the jobs synchronize before they leave the system. The focus is on methods to quantify the mean value of the ‘system’s sojourn time’ S: with S i denoting a job’s sojourn time in queue i, S is defined as max{S 1, S 2}. Earlier work has revealed that this class of models is notoriously hard to analyze. In this paper, we focus on the homogeneous case, in which the jobs generated at both queues stem from the same distribution. We first evaluate various bounds developed in the literature, and observe that under fairly broad circumstances these can be rather inaccurate. We then present a number of approximations, that are extensively tested by simulation and turn out to perform remarkably well.
Starting Page	723
Ending Page	742
Page Count	20
File Format	PDF
ISSN	01716468
Journal	OR Spectrum
Volume Number	34
Issue Number	3
e-ISSN	14366304
Language	English
Publisher	Springer-Verlag
Publisher Date	2011-01-15
Publisher Place	Berlin, Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Queueing Fork-join network Simulation Parallel processing Synchronization Throughput time Business/Management Science Calculus of Variations and Optimal Control; Optimization Operations Research/Decision Theory
Content Type	Text
Resource Type	Article
Subject	Management Science and Operations Research Business, Management and Accounting

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Mean sojourn times in two-queue fork-join systems: bounds and approximations

Performance evaluation of photolithography cluster tools : Queueing and throughput models

Large deviations without principle: join the shortest queue

Asymptotic expansions for the sojourn time distribution in the M/G/1-PS queue

Exact and approximate methods for parallel multiple-area spatial scheduling with release times

Approximations for the waiting-time distribution in an $$M/PH/c$$ priority queue

Queueing systems with inventory management with random lead times and with backordering

Revenue management

On a processor sharing queue that models balking

Mean sojourn times in two-queue fork-join systems: bounds and approximations

Similar Documents

Mean sojourn times in two-queue fork-join systems: bounds and approximations

Performance evaluation of photolithography cluster tools : Queueing and throughput models

Large deviations without principle: join the shortest queue

Asymptotic expansions for the sojourn time distribution in the M/G/1-PS queue

Exact and approximate methods for parallel multiple-area spatial scheduling with release times

Approximations for the waiting-time distribution in an $$M/PH/c$$ priority queue

Queueing systems with inventory management with random lead times and with backordering

Revenue management

On a processor sharing queue that models balking

Mean sojourn times in two-queue fork-join systems: bounds and approximations