Filters








17 Hits in 11.3 sec

Approximate analysis of a closed fork/join model

Y.C. Liu, H.G. Perros
1991 European Journal of Operational Research  
An approximation algorithm for analyzing a closed queueing systems with a K-sibling fork/join queue is presented. The procedure is based on decomposition and aggregation.  ...  However, it gives results which are an upper bound of the mean response time of the fork/ join operation and a lower bound of the system throughput, for both homogeneous and non-homogeneous cases.  ...  Conclusion We developed an approximation procedure for analyzing a closed queueing network with a Kvsibling fork/join queue. The approximation procedure is based on decomposition and aggregation.  ... 
doi:10.1016/0377-2217(91)90071-3 fatcat:aehwjz4jmvg3fcwau22cqmvyzu

Nested Fork-Join Queueing Network Model for Analysis of Airfield Operations

Craig J. Willits, Dennis C. Dietz
2001 Journal of Aircraft  
, McGraw-Hill, New York, 1992, p. 98. '3Baynat, B., and Dallery, Y., “A Decomposition Approximation for Closed Queueing Networks with Fork/Join Aubnetworks,” [FIP Transac- tions A (Computer Science and  ...  The equivalent network is shown in Fig. 6. /AO—EO\ ‘ aia Ol Uo(r9) Isolated fork-join subnetwork for Marie’s method.  ... 
doi:10.2514/2.2870 fatcat:kblkvlmbubdyfmi6p4kb3zjmam

An approximation method for general closed queuing networks with Fork/Join mechanisms

B Baynat, Y Dallery
2000 Journal of the Operational Research Society  
Maximal partition of the example of Figure 1. aynat and Y Dallery—An approximation method for general closed queuing networks with Fork/Join mechanisms 20] not possible to split a Fork/Join subnetwork  ...  Approximate analysis of a closed fork/join model. Eur J Opl Res 53: 382-392. Liu YC and Perros HG (1991). A decomposition procedure for the analysis of a closed fork/join queuing system.  ... 
doi:10.1057/palgrave.jors.2600885 fatcat:vikcltfbsbhjrm2rfiksq5auay

Page 208 of The Journal of the Operational Research Society Vol. 51, Issue 2 [page]

2000 The Journal of the Operational Research Society  
Approximate analysis of a closed fork/join model. Eur J Opl Res 53: 382-392. Liu YC and Perros HG (1991). A decomposition procedure for the analysis of a closed fork/join queuing system.  ...  A product-form approximation method for general closed queuing networks with several classes of customers. Perform Eval 24: 165-188. Cox DR (1955).  ... 

Mean Value Analysis of Military Airlift Operations at an Individual Airfield

Dennis C. Dietz
1999 Journal of Aircraft  
The airfield system is represented as a capacitated open network of multiserver queues and fork- join constructs that capture concurrent aircraft flow through subnetworks of activities.  ...  Mean re- sponse time, queue length, and utilization can be estimated for clone traffic at each station on each path provided two key approximations are adopted: 1) Approximation 1: For a network with N  ... 
doi:10.2514/2.2530 fatcat:fknvvjdn35fgpgxxdrkj35gc4a

Modeling parallel movement of lifts and vehicles in tier-captive vehicle-based warehousing systems

Bipan Zou, Xianhao Xu, Yeming (Yale) Gong, René De Koster
2016 European Journal of Operational Research  
We develop an approximation method based on decomposition of the fork-join queueing network to estimate the system performance.  ...  Highlights • We propose a parallel policy for autonomous tier-captive storage/retrieval systems. • A fork-join queueing network is formulated to analyze the system performance. • The parallel policy has  ...  A closed queueing network for the fork-join node We build a closed queueing network by short-circuiting the fork-join node (see Fig.3 ).  ... 
doi:10.1016/j.ejor.2016.03.039 fatcat:jftoeepwkzh3fgrg4a54zs2odq

Rapid improvement of stochastic networks using two-moment approximations

Julien Granger, Ananth Krishnamurthy, Stephen M. Robinson
2006 Mathematical and computer modelling  
This paper investigates a method for rapidly improving the performance of stochastic networks by substituting two-moment approximations for the usual repetitive simulation runs.  ...  The approximation methods appear to offer a very substantial advantage in speed.  ...  In [4] , the classical method of mean value analysis (MVA) for closed network of queues is used, in conjunction with an extension of a method originally developed in [12] .  ... 
doi:10.1016/j.mcm.2005.05.023 fatcat:syeyxyayjreu5a3bsxt7wzhzji

Modeling and performance analysis of shuttle-based compact storage systems under parallel processing policy

Lei Deng, Lei Chen, Jingjie Zhao, Ruimei Wang, Behzad Behdani
2021 PLoS ONE  
The system is modeled as a semi-open queueing network with class switching and the parallel movement of shuttles and the transfer car is modeled using a fork-join queueing network.  ...  The results also suggest an optimal depth/width ratio with a value of 1.75 for minimizing the expected throughput time in the real system.  ...  Acknowledgments We acknowledge the study of Tappia and his colleagues in supporting our research with real data.  ... 
doi:10.1371/journal.pone.0259773 pmid:34780510 pmcid:PMC8592453 fatcat:o6kxfnwpz5hafbxtqmw4jfiaxm

Page 850 of Journal of Aircraft Vol. 38, Issue 5 [page]

Journal of Aircraft  
If a fork-join queueing network (FJQN) has been feasibly parti- tioned using the preceding guidelines, then any subnetework con- taining a fork-join construct can be analyzed using either aggrega- tion  ...  .*’ In this method the subnetwork to be isolated is analyzed as a closed, independent network.  ... 

Page 1005 of Mathematical Reviews Vol. , Issue Index [page]

Mathematical Reviews  
(with Gershwin, Stanley B.) Equivalence relations in queueing models of fork/join networks with blocking. (Not in MR) Anantharam, V. (with Gopinath, B.; Hajela, D.)  ...  Second-order properties of the throughput of a closed queueing network. 90a:60178 — (with Sumita, Ushio) Modified Lindley process with replacement: dynamic behavior, asymptotic decomposition and applications  ... 

Approximate Throughput Computation of Stochastic Weighted T-Systems

Carlos J. Perez-Jimenez, Javier Campos, Manuel Silva
2007 IEEE transactions on systems, man and cybernetics. Part A. Systems and humans  
Second, after the decomposition phase, an iterative response time approximation method is applied for the throughput computation.  ...  Existence of convergence points for the iterative approximation method can be proved. Experimental results generally have an error of less than 5 %.  ...  From a queueing network perspective, WTS's are a mild generalization of Fork-Join Queueing Networks with Blocking where bulk movements of jobs are allowed.  ... 
doi:10.1109/tsmca.2007.893455 fatcat:uehfgynednhm7ldavnq4otywta

SLA Calculus

Sebastian Vastag, Technische Universität Dortmund, Technische Universität Dortmund
2015
For modeling Service-Oriented Architectures (SOAs) and validating worst-case performance guarantees a deterministic modeling method with efficient analysis is presented.  ...  With SLAs providers implicate a maximum delay for their products when the customer limits the workload to their systems.  ...  In [114] Varki presented a MVA extension that allows one to approximate the average response times for closed fork/join Queueing Networks with more than two M/M/1 queues in synchronization.  ... 
doi:10.17877/de290r-7135 fatcat:abrbo4vaujhibgq7p7hychtyxq

Performance evaluation of shuttle-based storage and retrieval systems using discrete-time queueing network models

Martin Epp
2018
The approach is based on the modeling of SBS/RSs as discrete-time open queueing networks and yields the complete probability distributions of the performance measures.  ...  In this work, a new approach is developed that can be applied to model different configurations of SBS/RSs.  ...  Hence, they develop an approximation method based on the decomposition principle of the fork-join network (see Bolch et al. (1998) ).  ... 
doi:10.5445/ksp/1000077211 fatcat:vn5ys7eb7fh5zjbzputk55bs3q

A general iterative technique for approximate throughput computation of stochastic marked graphs

J. Campos, J.M. Colom, H. Jungnitz, M. Silva
Proceedings of 5th International Workshop on Petri Nets and Performance Models  
Second, after the decomposition phase, an iterative response time approximation method is applied for the computation of the throughput.  ...  A general iterative technique for approximate throughput computation of stochastic strongly connected marked graphs is presented.  ...  From a queueing network perspective, it can be seen 13] that, provided strong connectivity, they are isomorphic to fork/join queueing networks with blocking (FJQN/B).  ... 
doi:10.1109/pnpm.1993.393427 dblp:conf/pnpm/CamposCJS93 fatcat:n4qykob7rbbujjskn6wu6ntgou

Response times in healthcare systems

Susanna Wau Men Au-Yeung, William Knottenbelt, Peter Harrison, EPSRC
2008
Next we present a hierarchical multiclass queueing network model of patient flow in our case study A&E department.  ...  In particular, Accident and Emergency (A&E) departments in England have been placed under increasing pressure, with attendances rising year on year, and a national government target whereby 98% of patients  ...  Overlapping testing and scanning can be incorporated into the model by using a fork-join queue [17, 70] .  ... 
doi:10.25560/1297 fatcat:rq6twt2v6vgi5bkcpzpnsjsleq
« Previous Showing results 1 — 15 out of 17 results