• Journal of Korea Society of Industrial Information Systems
• /
• v.29 no.1
• /
• pp.63-76
• /
• 2024

In this study, we analyzed queue length and sojourn time of discrete-time BMAP/G/1 queues under the workload control. Group customers (packets) with correlations arrive at the system following a discrete-time Markovian arrival process. The server starts busy period when the total service time of the arrived customers exceeds a predetermined workload threshold D and serves customers until the system is empty. From the analysis of workload and waiting time, distributions of queue length at the departure epoch and arbitrary time epoch and system sojourn time are derived. We also derived the mean value as a performance measure. Through numerical examples, we confirmed that we can obtain results represented by complex forms of equations, and we verified the validity of the theoretical values by comparing them with simulation results. From the results, we can obtain key performance measures of complex systems that operate similarly in various industrial fields and to analyze various optimization problems.

• Journal of Korea Society of Industrial Information Systems
• /
• v.29 no.2
• /
• pp.69-80
• /
• 2024

In this paper, we studied a discrete-time queuing system that operates under a mixed situation of D-policy and T-policy, one of the representative server control policies in queuing theory. A single server serves customers arriving by Bernoulli arrival process on a first-in, first-out basis(FIFO). If there are no customers to serve in the system, the server goes on vacation and returns, until the total service time (i.e., total amount of workload) of waiting customers exceeds predetermined workload threshold D. The operation of the system covered in this study can be used to model the efficient resource utilization of mobile devices using secondary batteries. In addition, it is significant in that the steady state waiting time and system sojourn time of the queuing system under a flexible mixed control policy were derived within a unified framework.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.14 no.2
• /
• pp.14-20
• /
• 2005

This paper describes a dwell time calculation algorithm for polishing tool path generation in the small toot polishing process of the axis-symmetrical lens. Generally dwell time control in the polishing machines means that small polishing tool stays for a dwell time at the specific surface position to get the expected polishing depth. Polishing depth distribution on an aspherical lens surface consists of the superposition of the local polishing depth at the each dwell position. Therefore, tool path generation needs each dwell time together with tool positioning data during the polishing tool movements on the aspherical lens surface. The linear algebraic equation of removal depth removal matrix and dwell time is formulated. Parametric effects such as the dwell d interval are simulated to validate the dwell time calculation algorithm.

• Journal of KIISE:Software and Applications
• /
• v.26 no.11
• /
• pp.1288-1297
• /
• 1999

오늘날 많은 워크플로우 응용들은 마감 시간과 같은 시간 제약 조건들의 효율적인 관리를 요구하고 있다. 이러한 시간 제약성 워크플로우의 가장 중요한 목적들 중의 하나는 마감 시간을 만족하는 워크플로우 인스턴스의 수를 최대화하는 것이다. 시간 제약성 워크플로우 처리의 성능을 개선하기 위해서는 효과적인 액티비티들의 마감 시간 할당 방법이 요구된다. 이에 본 논문에서는 액티비티의 체재 시간과 워크플로우 제어 구조들의 특성을 고려하여 효과적인 마감 시간 할당 방법인 PST를 제안한다. PST는 기존의 방법들과 달리 워크플로우 제어 흐름을 분석하여 액티비티의 마감 시간을 할당하기 때문에 과부하에서도 높은 성능을 지원할 수 있다. 부가적으로 기존의 방법들과 성능 평가를 통해 본 논문에서 제안된 방법의 효용성을 검증한다.Abstract Nowadays, many workflow applications are requiring efficient time management such as deadline. With time-constrained workflows, one of the most important goals is to maximize the number of workflow instances that satisfy the deadline. In this regard, effective deadline assignment mechanisms should be developed to achieve high performance of time-constrained workflow processing. We propose in this paper our novel deadline assignment method called PST based on both an activity's sojourn time and the characteristics of workflow control structures. Because the method allocates the deadline to activities from analyzing the control flow of workflow, it can support good and stable workflow performance even under the high workload. In addition, we validate the usefulness of our proposed method through various experiments.

• Journal of the Korea Safety Management & Science
• /
• v.9 no.5
• /
• pp.57-66
• /
• 2007

본 논문에서는 통신망의 트래픽 제어를 위한 무한버퍼, 단일 서버와 배치도착과정을 갖는 대기행렬 모형을 고려하였다. 또한 고객 도착 형태와 서비스의 분포는 지수분포를 배치 흐름은 포아송 정상과정 및 배치크기는 기하분포를 따른다고 가정하였다. 서비스를 받기 위해 시스템으로 들어오는 배치의 크기는 시스템의 상태에 따라서 트래픽 제어가 가능하다. 이와 같은 조건에서 시스템에 있는 고객의 수와 배치크기에 대한 결합 확률분포를 분석하였고, 행렬기법을 적용하여 시스템 체재시간에 대한 분석이 수행되었다. 마지막으로 시스템의 주요 성능평가 척도에 대한 효율적인 제어기법에 대한 언급과 수치예제를 통해서 증명하였다.

• Journal of Korea Society of Industrial Information Systems
• /
• v.23 no.2
• /
• pp.29-39
• /
• 2018

In this paper, we discuss a discrete-time queueing system with dyadic server control policy that combines workload control and multiple vacations. Customers arrive at the system with Bernoulli arrival process. If there is no customer to serve in the system, an idle single server spends a vacation of discrete random variable V and returns. The server repeats the vacation until the total service time of waiting customers exceeds the predetermined workload threshold D. In this paper, we derived the steady-state workload distribution of a discrete-time queueing system which is operating under a more realistic and flexible server control policy. Mean workload is also derived as a performance measure. The results are basis for the analysis of system performance measures such as queue lengths, waiting time, and sojourn time.

• Journal of the Korean Society for Precision Engineering
• /
• v.18 no.7
• /
• pp.65-71
• /
• 2001

The development process of the polishing system for the aspherical lens mold for opto-electronics industry is described. The system uses the method that polishing tool is scanned on the surface under PC-NC control for the aspherical lens mold. The two axes interpolation of the minimum translation mechanism is applied to give uniform working condition by motion analysis. An aspherical surface is divided into multiple sections and each dwell time is calculated from the polishing rate model based on the Preston equation. As result of form error compensation experiment, initial form error is decreased about 25% while an average value of surface roughness is also reduced successfully from 180nm to 19nm.

• Journal of the Korean Society for Precision Engineering
• /
• v.30 no.3
• /
• pp.324-330
• /
• 2013

This paper describes a novel method to surface large optics mirror with an extremely high hardness, which could replace the high cost of the repetitive off-line measurement steps and the large ultra-precision grinding machine with ultra-positioning control of 10 nm resolution. A lot of diamond pellet to be attached on the convex aluminum base consists of a grinding tool for the concave large mirror, and the tool was pressured down on the large mirror blank. The tool motion at an interval on the spiral path was controlled with each feed rate as the dwell time in the conventional computer-controlled polishing. The shape to be surfaced was measured directly by a touch probe on the machine without any separation of the mirror blank. Total 40 iterative steps of the surfacing and measurement could demonstrate the form error of RMS $7.8{\mu}m$, surface roughness of Ra $0.2{\mu}m$ for the mirror blank with diameter of 1 m and spherical radius of curvature of 5400 mm.