• Title/Summary/Keyword: Queueing Models

Search Result 105, Processing Time 0.021 seconds

Analytical Models and their Performance Analysis of Superscalar Processors (수퍼스칼라 프로세서의 해석적 모델 및 성능 분석)

  • Kim, Hak-Jun;Kim, Seon-Mo;Choe, Sang-Bang
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.7
    • /
    • pp.847-862
    • /
    • 1999
  • 본 논문에서는 유한버퍼의(finite-buffered) 동기화된(synchronous) 큐잉모델(queueing model)을 이용하여 명령어들간의 병렬성, 분기명령의 빈도수, 분기예측(branch prediction)의 정확도, 캐쉬미스 등의 파라미터들을 고려하여 프로세서의 명령어 실행율을 예측하며 캐쉬의 성능과 파이프라인 성능간의 관계를 분석할 수 있는 새로운 해석적 모델을 제안하였다. 해석적 모델은 모델의 타당성을 검증하기 위해서 시뮬레이션을 수행하여 얻은 결과와 비교하였다. 해석적 모델과 시뮬레이션을 비교한 결과 대부분 10% 오차 내에서 일치하였다. 본 연구를 통하여 얻은 해석적 모델을 사용하면 시뮬레이션에서는 드러나지 않는 성능제약의 원인에 대한 명확한 규명이 가능하기 때문에 성능향상을 위한 설계자료를 얻을 수 있으며, 시스템 성능 밸런스를 위한 캐쉬와 비순차이슈 파이프라인 성능간의 관계에 대한 정확한 분석이 가능하다.Abstract This research presents a novel analytic model to predict the instruction execution rate of superscalar processors using the queuing model with finite-buffer size and synchronous operation mode. The proposed model is also able to analyze the performance relationship between cache and pipeline. The proposed model takes into account various kinds of architectural parameters such as instruction-level parallelism, branch probability, the accuracy of branch prediction, cache miss, and etc.. To prove the correctness of the model, we performed extensive simulations and compared the results with the analytic model. Simulation results showed that the proposed model can estimate the average execution rate accurately within 10% error compared to simulation results. The proposed model can explain the causes of performance bottleneck which cannot be uncovered by the simulation method only. The model is also able to show the effect of the cache miss on the performance of out-of-order issue superscalar processors, which can provide an valuable information in designing a balanced system.

Spreadsheet Model Approach for Buffer-Sharing Fork-Join Production Systems with General Processing Times and Structure (일반 공정시간과 구조를 갖는 버퍼 공유 분기-접합 생산시스템의 스프레드시트 모형 분석)

  • Seo, Dong-Won
    • Journal of the Korea Society for Simulation
    • /
    • v.28 no.3
    • /
    • pp.65-74
    • /
    • 2019
  • For many years, it has been widely studied on fork-join production systems but there is not much literature focusing on the finite buffer(s) of either individuals or shared, and generally distributed processing times. Usually, it is difficult to handle finite buffer(s) through a standard queueing theoretical approach. In this study, by using the max-plus algebraic approach we studied buffer-shared fork-join production systems with general processing times. However, because it cannot provide proper computational ways for performance measures, we developed simulation models using @RISK software and the expressions derived from max-plus algebra. From the simulation experiments, we compared some properties on waiting time with respect to a buffer capacity under two blocking policies: BBS (Blocking Before Service) and BAS (Blocking After Service).

Simulation of the Phase-Type Distribution Based on the Minimal Laplace Transform (최소 표현 라플라스 변환에 기초한 단계형 확률변수의 시뮬레이션에 관한 연구)

  • Sunkyo Kim
    • Journal of the Korea Society for Simulation
    • /
    • v.33 no.1
    • /
    • pp.19-26
    • /
    • 2024
  • The phase-type, PH, distribution is defined as the time to absorption into a terminal state in a continuous-time Markov chain. As the PH distribution includes family of exponential distributions, it has been widely used in stochastic models. Since the PH distribution is represented and generated by an initial probability vector and a generator matrix which is called the Markovian representation, we need to find a vector and a matrix that are consistent with given set of moments if we want simulate a PH distribution. In this paper, we propose an approach to simulate a PH distribution based on distribution function which can be obtained directly from moments. For the simulation of PH distribution of order 2, closed-form formula and streamlined procedures are given based on the Jordan decomposition and the minimal Laplace transform which is computationally more efficient than the moment matching methods for the Markovian representation. Our approach can be used more effectively than the Markovian representation in generating higher order PH distribution in queueing network simulation.

The Study on the Economic Appraisal of Fishing Port Investments (어항투자사업의 경제성 평가에 관한 연구)

  • 정형찬
    • The Journal of Fisheries Business Administration
    • /
    • v.14 no.2
    • /
    • pp.15-68
    • /
    • 1983
  • From the economic point of view the fishing port is the complex of installations on land, organized to serve the fishing fleet and its cargo, and is the main link in the production chain of all components of the fishing industry, with the aim of achieving the planned targets with the minimum cost. Fishing port investment decisions have had significant impact on the development aims of Korean fisheries. Fishing port investments in Korea are made mostly by public or semipublic port authorities. Such investments should be judged not purely on the basis of financial profitability but rather on the extent to which they serve the development aims of the fishing industry. This makes the economic appraisal process more complex and presents certain problems in correctly quantifying the economic costs and benefits of the fishing port projects. This study concentrates more on the theoretical economic appraisal models than on the purely financial aspects of fishing port investments and points out the difference between the two approaches. In the result, there is clearly an element of judgment as to whether or not a shadow price needs to be used in estimating economic benefits and costs. From this viewpoint, some attempts are made to provide definitions of the possible economic benefits and costs, and methods for estimating and evaluating them in Part III and IV. Especially queueing theory is applied in the calculation of economic benefits. When a project is contemplated and analysis shows it to Lave a positive NPV, one question that arises is whether it should be implemented now or delayed. In this paper, the first year rate of return method is regarded as a more concise way of solving the timing of investment, At the end of Part IV, risk analysis of fishing port investments is considered. It can be handled in a number of ways, ranging from informal judgment to complex statistical analyses involving large-scale computer models, This paper recommends that evaluators of fishing port investments use the sensitivity analysis indicating exactly how much NPV will change in response to a given change in an input variable, other things held constant. Decisions regarding the amount of capacity to provide must be made in fishing port investments. Providing too much service would involve excessive capital costs. On the other hand, not providing enough service capacity would cause the waiting line of fishing vessels to become excessively long at times. Therefore, in Part V, the optimal number of berths and berth productivity in fishing port are defined as follows: Minimize E(TC) = E(WC)+E(SC) The minimum of this function is the solution and that is the optimal number of berth and berth productivity in fishing port.

  • PDF

A study on the improvement of work flow and productivity in complex manufacturing line by employing the effective process control methods (복잡한 생산라인에서 효율적 공정관리 기법 도입에 따른 공정흐름 및 생산성 개선 연구)

  • Park, Kyungmin;Jeong, Sukjae
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.17 no.5
    • /
    • pp.305-315
    • /
    • 2016
  • Due to the change from small volume production to small quantity batch production systems, individual companies have been attempting to produce a wide range of operating strategies, maximize their productivity, and minimize their WIP level by operating with the proper cycle time to defend their market share. In particular, using a complex workflow and process sequence in the manufacturing line has some drawbacks when it comes to designing the production strategy by applying analytical models, such as mathematical models and queueing theory. For this purpose, this paper uses three heuristic algorithms to solve the job release problem at the bottleneck workstation, product mix problem in multi-purpose machine(s), and batch size and sequence in batch machine(s). To verify the effectiveness of the proposed methods, a simulation analysis was performed. The experimental results demonstrated that the combined application of the proposed methods showed positive effects on the reduction of the cycle time and WIP level, and improvement of the throughput.