Opening book details…
Can I read Sojourn times in G/M/1 fork‐join networks on EtoBox?
Sojourn times in G/M/1 fork‐join networks by Sung‐Seok Ko; Richard F. Serfozo is a Engineering article available to read on EtoBox.
What is Sojourn times in G/M/1 fork‐join networks about?
## Abstract We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of __m__ tasks, which are instantaneously assigned by the fork‐node to __m__ task‐processing nodes that operate like __G__/__M__/1 queueing stations. The job is completed when all of its __m__ tasks are finished. The sojourn time (or response time) of a job in this __G__/__M__/1 fork‐join network is the total time it takes to complete the __m__ tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of __D__/__M__/1 and __M__/__M__/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008
Who reads Sojourn times in G/M/1 fork‐join networks?
It is typically read by researchers, students, and practitioners in Engineering.
- Author
- Sung‐Seok Ko; Richard F. Serfozo
- Publisher
- John Wiley and Sons; Wiley (John Wiley & Sons); John Wiley & Sons Inc.; Wiley (ISSN 0894-069X)
- Published
- 2008
- Language
- EN
- Field
- Engineering (Physical Sciences)