• Communications for Statistical Applications and Methods
• /
• 제19권1호
• /
• pp.169-175
• /
• 2012

The sensitivity of the performance measures such as the mean and the standard deviation of the queue length and the blocking probability with respect to the moments of the service time are numerically investigated. The service time distribution is fitted with phase type(PH) distribution by matching the first three moments of service time and the M/G/c retrial queue is approximated by the M/PH/c retrial queue. Approximations are compared with the simulation results.

• 대한수학회지
• /
• 제42권3호
• /
• pp.517-527
• /
• 2005

This paper considers a discrete-time queueing system with variable service capacity. Using the supplementary variable method and the generating function technique, we compute the joint probability distribution of queue length and remaining service time at an arbitrary slot boundary, and also compute the distribution of the queue length at a departure time.

• Journal of applied mathematics & informatics
• /
• 제28권1_2호
• /
• pp.275-282
• /
• 2010

This paper analyzes a discrete-time bulk-service queue with probabilistic bulk size, where the service process is interrupted by a Markov chain. We study the joint probability generating function of system occupancy and the state of the Markov chain. We derive several performance measures of interest, including average system occupancy and delay distribution.

• Journal of applied mathematics & informatics
• /
• 제31권1_2호
• /
• pp.147-154
• /
• 2013

We analyze queueing model with priority scheduling by supplementary variable method. Customers are classified into two types (type-1 and type-2 ) according to their characteristics. Customers of each type arrive by independent Poisson processes, and all customers regardless of type have same general service time. The service order of each type is determined by the queue length of type-1 buffer. If the queue length of type-1 customer exceeds a threshold L, the service priority is given to the type-1 customer. Otherwise, the service priority is given to type-2 customer. Method of supplementary variable by remaining service time gives us information for queue length of two buffers. That is, we derive the differential difference equations for our queueing system. We obtain joint probability generating function for two queue lengths and the remaining service time. Also, the mean queue length of each buffer is derived.

• Journal of information and communication convergence engineering
• /
• 제19권4호
• /
• pp.257-262
• /
• 2021

Providing web services to users has become expensive in recent times. For better web services, a web server is provided with high-performance technology. To achieve great web service experiences, tools such as general-purpose graphics processing units (GPGPUs), artificial intelligence, high-performance computing, and three-dimensional simulation are widely used. However, graphics processing units (GPUs) are used in high-speed operations and have limited general applications. In this study, we developed a task queue in a GPU to improve the performance of a web service using a multiprocessor and studied how to receive and process user requests in bulk. We propose the use of a GPGPU-based task queue to process user requests more than GPGPU based a central processing unit thread, and to process more GPU threads on task queue at about 136% to 233%, and proved that the proposed method is effective for web service.

• Journal of the Korean Statistical Society
• /
• 제34권1호
• /
• pp.39-47
• /
• 2005

We adopt the P/sub λ, T//sup M/ policy of dam to introduce a service policy with alternating service rates for a Poisson arrival queue, in which the service rate alternates depending on the number of customers in the system. The stationary distribution of the number of customers in the system is derived and, after operating costs being assigned to the system, the optimization of the policy is studied.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제18권4호
• /
• pp.295-304
• /
• 2014

We analyze theMMPP/G/1/K queue with a modified state-dependent service rate. The service time of customers upon service initiation is changed if the number of customers in the system reaches a threshold. Then, the changed service time is continued until the system becomes empty completely, and this process is repeated. We analyze this system using an embedded Markov chain and a supplementary variable method, and present the queue length distributions at a customer's departure epochs and then at an arbitrary time.

• 대한수학회보
• /
• 제46권4호
• /
• pp.673-689
• /
• 2009

We analyze $MAP_1,\;MAP_2$/G/1 finite queues with service scheduling function dependent upon queue lengths. The customers are classified into two types. The arrivals of customers are assumed to be the Markovian Arrival Processes (MAPs). The service order of customers in each buffer is determined by a service scheduling function dependent upon queue lengths. Methods of embedded Markov chain and supplementary variable give us information for queue length of two buffers. Finally, the performance measures such as loss probability and mean waiting time are derived. Some numerical examples also are given with applications in telecommunication networks.

• 대한산업공학회지
• /
• 제28권1호
• /
• pp.36-43
• /
• 2002

We analyze bulk service $M/G^{b}/1$ queues using the arrival time approach of Chae et al. (2001). As a result, the decomposition property of the M/G/1 queue with generalized vacations is extended to the $M/G^{b}/1$ queue in which the batch size is exactly a constant b. We also demonstrate that the arrival time approach is useful for relating the time-average queue length PGF to that of the departure time, both for the $M/G^{b}/1$queue in which the batch size is as big as possible but up to the maximum of constant b. The case that the batch size is a random variable is also briefly mentioned.

• 대한수학회보
• /
• 제43권2호
• /
• pp.277-292
• /
• 2006

We consider a single-server queue with service time distribution of phase type where positive customers, negative customers and disasters arrive according to a Markovian arrival process with marked transitions (MMAP). We derive simple formulae for the stationary queue length distributions. The Laplace-Stieltjes transforms (LST's) of the sojourn time distributions under the combinations of removal policies and service disciplines are also obtained by using the absorption time distribution of a Markov chain.