• Title/Summary/Keyword: Parallel Queueing systems

Search Result 9, Processing Time 0.023 seconds

Optimal Server Allocation to Parallel Queueing Systems by Computer Simulation (컴퓨터 시뮬레이션을 이용한 병렬 대기행렬 시스템의 최적 서버 배치 방안)

  • Park, Jin-Won
    • Journal of the Korea Society for Simulation
    • /
    • v.24 no.3
    • /
    • pp.37-44
    • /
    • 2015
  • A queueing system with 2 parallel workstations is common in the field. Typically, the workstations have different features in terms of the inter arrival times of customers and the service times for the customers. Computer simulation study on the optimal server allocation for parallel heterogeneous queueing systems with fixed number of identical servers is presented in this paper. The queueing system is optimized with respect to minimizing the weighted system time of the customers served by 2 parallel workstations. The system time formula for the M/M/c systems in Kendall's notation is known. Thus, we first compute the optimal allocation for parallel M/M/c systems, comparing the results with those from the computer simulation experiments, and have the same results. The CETI rule is devised through optimizing M/M/c cases, which allocates the servers based on Close or Equal Traffic Intensities between workstations. Traffic intensity is defined as the arrival rate divided by the service rate times the number of servers. The CETI rule is shown to work for M/G/c, G/M/c queueing systems by numerous computer simulation experiments, even if the rule cannot be proven analytically. However, the CETI rule is shown not to work for some of G/G/c systems.

THROUGHPUT ANALYSIS OF TWO-STAGE MANUFACTURING SYSTEMS WITH MERGE AND BLOCKING

  • Shin, Yang Woo;Moon, Dug Hee
    • Journal of applied mathematics & informatics
    • /
    • v.33 no.1_2
    • /
    • pp.77-87
    • /
    • 2015
  • Parallel lines are often used to increase production rate in many manufacturing systems where the main line splits into several lines in parallel, and after some operations, they merge into a main line again. Queueing networks with finite buffers have been widely used for modeling and analyzing manufacturing systems. This paper provides an approximation technique for multi-server two-stage networks with merge configuration and blocking which will be a building block for analysis of general manufacturing systems with parallel lines and merge configuration. The main idea of the method is to decompose the original system into subsystems that have two service stations with multiple servers, two buffers and external arrivals to the second stage are allowed. The subsystems are modeled by level dependent quasi-birth-and-death (LDQBD) process.

A Performance Evaluation of Fully Asynchronous Disk Array Using Simulation Method (시뮬레이션 기법을 이용한 완전 비동기 디스크 어레이 성능 평가)

  • 오유영
    • Journal of the Korea Society for Simulation
    • /
    • v.8 no.2
    • /
    • pp.29-43
    • /
    • 1999
  • As real-time processing of data with large storage space is required in the era of multimedia, disk arrays are generally used as storage subsystems which be able to provide improved I/O performance. To design the cost-effective disk array, it is important to develop performance models which evaluate the disk array performance. Both queueing theory and simulation are applicable as the method of performance evaluation through queueing modeling. But there is a limit to the analytical method using queueing theory due to the characteristics of disk array requests being serviced in the parallel and concurrent manner. So in this paper we evaluate the disk array performance using simulation method which abstract disk array systems in the low level. Performance results were evaluated through simulation, so that mean response time, mean queueing delay, mean service time, mean queue length for disk array requests and utilization, throughput for disk array systems, can be utilized for capacity planning in the phase of disk array design.

  • PDF

Throughput Upper and lower Bounds for Assembly/Disassembly Queueing Networks with Blocking (봉쇄현상이 있는 조립/분해 대기행렬망의 산출율 상한 및 하한에 대한 연구)

  • Paik, Chun-Hyun
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.23 no.4
    • /
    • pp.769-778
    • /
    • 1997
  • Assembly/Disassembly Queueing Networks (ADQNs) with finite buffers have been used as a major tool for evaluating the performances of manufacturing and parallel processing systems. In this study, we present simple but effective methods which yield throughput upper and lower bounds for ADQNs with exponential service times and finite buffers. These methods are based on the monotonicity properties of throughputs with respect to service times and buffer capacities. The throughput-upper bounding method is elaborated on with general network configuration (specifically acyclic configuration). But our lower bounding method is restricted to the ADQNs with more specialized configuration. Computational experiments will be performed to confirm the effectiveness of our throughput-bounding methods.

  • PDF

Dependability Analysis of Parallel Video Servers Using Fault Injection Simulation (결함 주입 시뮬레이션을 이용한 병렬 비디오 서버의 의존도 분석)

  • 정지영;김성수
    • Journal of the Korea Society for Simulation
    • /
    • v.9 no.2
    • /
    • pp.51-61
    • /
    • 2000
  • In recent years, significant advances in computers and communication technologies have made multimedia services feasible. As a result, various queueing models and cost models on architecture and data placement for multimedia server have been proposed. However, most of these models do not evaluate dependability of systems. In the design phase of a system, simulation is an important experimental means for performance and dependability analysis. Fault injection simulation has been used in evaluation of dependability metric. In this paper, we develop fault injection simulation model to analyze dependability of parallel video servers. In addition, we evaluate reliability and MTTF(Mean Time To Failure) of systems by using the simulator.

  • PDF

Multimicrocomputer Network Design for Real-Time Parallel Processing (실시간 병렬처리를 위한 다중마이크로컴퓨터망의 설계)

  • 김진호;고광식;김항준;최흥문
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.10
    • /
    • pp.1518-1527
    • /
    • 1989
  • We proposed a technique to design a multimicrocomputer system for real-time parallel processing with an interconnection network which has good network latency time. In order to simplify the performance evaluation and the design procedure under the hard real-time constraints we defined network latency time which takes into account the queueing delays of the networks. We designed a dynamic interconnection network following the proposed technique, and the simulation results show that we can easily estimate the multimicrocomputer system's approximate performance using the defined network latency time before the actual design, so this definition can help the efficient design of the real-time parallel processing systems.

  • PDF

A Study on New Cell Switch Fabric for Increasing the Performance of ATM Switching Systems (ATM 교환 시스템의 성능향상을 위한 새로운 셀 스위치 구조 연구)

  • 정진태;이옥재;전병실
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.3
    • /
    • pp.12-23
    • /
    • 1997
  • In this paper, we propose a new cell switch fabric for increasing the performance of ATM switching systems. Proposed switching network consists of a sorting network and a routing network. Both of these are multistage networks where each stage performs a fixed permutation on the incoming lines, and then routes them through a clumn of 2x2 switching elements. It is designed for distributing inputs and parallel processing to reduce the hardware complexity and obtain high performance of switching network. The structure and the operation of th eswitching network aredescribed and the performanceof the switching network is anlyzed under uniform traffic models. In this result, though the size of proposed network is increased the large scale, it has always the same throughput as the that of genral output queueing system with N=2. So, it is found that our proposed network is appropriate for the high apeed and lrger size of ATM switching systems.

  • PDF

Some Recent Results of Approximation Algorithms for Markov Games and their Applications

  • 장형수
    • Proceedings of the Korean Society of Computational and Applied Mathematics Conference
    • /
    • 2003.09a
    • /
    • pp.15-15
    • /
    • 2003
  • We provide some recent results of approximation algorithms for solving Markov Games and discuss their applications to problems that arise in Computer Science. We consider a receding horizon approach as an approximate solution to two-person zero-sum Markov games with an infinite horizon discounted cost criterion. We present error bounds from the optimal equilibrium value of the game when both players take “correlated” receding horizon policies that are based on exact or approximate solutions of receding finite horizon subgames. Motivated by the worst-case optimal control of queueing systems by Altman, we then analyze error bounds when the minimizer plays the (approximate) receding horizon control and the maximizer plays the worst case policy. We give two heuristic examples of the approximate receding horizon control. We extend “parallel rollout” and “hindsight optimization” into the Markov game setting within the framework of the approximate receding horizon approach and analyze their performances. From the parallel rollout approach, the minimizing player seeks to combine dynamically multiple heuristic policies in a set to improve the performances of all of the heuristic policies simultaneously under the guess that the maximizing player has chosen a fixed worst-case policy. Given $\varepsilon$>0, we give the value of the receding horizon which guarantees that the parallel rollout policy with the horizon played by the minimizer “dominates” any heuristic policy in the set by $\varepsilon$, From the hindsight optimization approach, the minimizing player makes a decision based on his expected optimal hindsight performance over a finite horizon. We finally discuss practical implementations of the receding horizon approaches via simulation and applications.

  • PDF

Quality of Coverage Analysis on Distributed Stochastic Steady-State Simulations (분산 시뮬레이션에서의 Coverage 분석에 관한 연구)

  • Lee, Jong-Suk-R.;Park, Hyoung-Woo;Jeong, Hae-Duck-J.
    • The KIPS Transactions:PartA
    • /
    • v.9A no.4
    • /
    • pp.519-524
    • /
    • 2002
  • In this paper we study the qualify of sequential coverage analysis under a scenario of distributed stochastic simulation known as MRIP(Multiple Replications In Parallel) in terms of the confidence intervals of coverage and the speedup. The estimator based in the F-distribution was applied to the sequential coverage analysis of steady-state means. in simulations of the $M/M/1/{\infty},\;M/D/I/{\infty}\;and\;M/H_{2}/1/{\infty}$ queueing systems on a single processor and multiple processors. By using multiple processors under the MRIP scenario, the time for collecting many replications needed in sequential coverage analysis is reduced. One can also easily collect more replications by executing it in distributed computers or clusters linked by a local area network.