Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Two Parallel Queues Created by Arrivals with Two Demands II

1 references·15 citing·37 second hop

FromToDepth

this work references cited by second hop

References

1984Two Parallel Queues Created by Arrivals with Two Demands I309 cited

Cited by

2004Response times in M/M/s fork-join networks60 cited
2001Response time analysis of parallel computer and storage systems55 cited
1992Two parallel processors with coupled inputs54 cited
1998Computing performance bounds of fork-join parallel programs under a multiprocessing environment45 cited
2014Scheduling tasks with precedence constraints on multiple servers37 cited
2011Tail asymptotics for a generalized two-demand queueing model—a kernel method36 cited
2001A hybrid solution of fork/join synchronization in parallel queues33 cited
2008Sojourn times in G/M/1 fork‐join networks32 cited
2009Exact tail asymptotics in a priority queue—characterizations of the preemptive model29 cited
1996A fork-join queueing model: Diffusion approximation, integral representations and asymptotics25 cited
2023Optimal management strategies of renewable energy systems with hyperexponential service provisioning: an economic investigation24 cited
2010An Upper Bound Solution for Homogeneous Fork/Join Queuing Systems20 cited
2003Heavy Traffic Analysis of Two Coupled Processors19 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

2011

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

19 cited

1991Approximate analysis of a closed fork/join model19 cited