• Journal of Information Processing Systems
• /
• v.17 no.2
• /
• pp.297-305
• /
• 2021

Large amount of data is being generated in gaming servers due to the increase in the number of users and the variety of game services being provided. In particular, load balancing schemes for gaming servers are crucial consideration. The existing literature proposes algorithms that distribute loads in servers by mostly concentrating on load balancing and cooperative offloading. However, many proposed schemes impose heavy restrictions and assumptions, and such a limited service classification method is not enough to satisfy the wide range of service requirements. We propose a load balancing agent that combines the dynamic allocation programming method, a type of greedy algorithm, and proximal policy optimization, a reinforcement learning. Also, we compare performances of our proposed scheme and those of a scheme from previous literature, ProGreGA, by running a simulation.

• Annual Conference of KIPS
• /
• 2007.05a
• /
• pp.1431-1434
• /
• 2007

시스템의 한정된 자원을 다수의 사용자들이 프로그램 실행 시 자원을 효율적으로 배분하기 위하여 작업관리 시스템을 이용한다. IBM 시스템은 작업관리 시스템으로서 주로 LoadLeveler를 사용한다. LoadLeveler에서의 메모리 관리는 WLM(Workload Manager)에서 설정하며, WLM의 환경 설정에 따라 작업의 실행에 많은 영향을 받는다. 본 논문에서는 WLM의 환경 설정에 의한 LoadLeveler에서의 작업을 실행하면서 메모리 변화와 실행 시간을 측정하고 분석하였다. 따라서 시스템의 특성과 사용자 작업에 알맞은 최적의 WLM 환경을 적용함으로써 시스템의 안정성을 유지하고 전체 작업처리 효율을 증가시켰다.

• Journal of Broadcast Engineering
• /
• v.10 no.1 s.26
• /
• pp.83-102
• /
• 2005

The problem of video scheduling is analyzed in the framework of divisible load scheduling. A divisible load can be divided into any number of fractions (parts) and can be processed/computed independently on the processors in a distributed computing system/network, as there are no precedence relationships. In the video scheduling, a frame can be split into any number of fractions (tiles) and can be processed independently on the processors in the network, and then the results are collected to recompose the single processed frame. The divisible load arrives at one of the processors in the network (root processor) and the results of the computation are collected and stored in the same processor. In this problem communication delay plays an important role. Communication delay is the time to send/distribute the load fractions to other processors in the network. and the time to collect the results of computation from other processors by the root processors. The objective in this scheduling problem is that of obtaining the load fractions assigned to each processor in the network such that the processing time of the entire load is a minimum. We derive closed-form expression for the processing time by taking Into consideration the communication delay in the load distribution process and the communication delay In the result collection process. Using this closed-form expression, we also obtain the optimal number of processors that are required to solve this scheduling problem. This scheduling problem is formulated as a linear pro-gramming problem and its solution using neural network is also presented. Numerical examples are presented for ease of understanding.

• Journal of Computing Science and Engineering
• /
• v.7 no.4
• /
• pp.220-230
• /
• 2013

In recent years, progress in hardware technology has resulted in the possibility of monitoring many events in real time. The volume of incoming data may be so large, that monitoring all individual data might be intractable. Revisiting any particular record can also be impossible in this environment. Therefore, many database schemes, such as aggregation, join, frequent pattern mining, and indexing, become more challenging in this context. This paper surveys the previous efforts to resolve these issues in processing data streams. The emphasis is on specifying and processing sliding window queries, which are supported in many stream processing engines. We also review the related work on stream query processing, including synopsis structures, plan sharing, operator scheduling, load shedding, and disorder control.

• Journal of architectural history
• /
• v.25 no.3
• /
• pp.23-35
• /
• 2016

The purpose of this study is to classify types of the eaves structure of buildings with the Jusimpo-type structure and to analyze the characteristics of each eaves structure. For this objective, forty buildings were selected and investigated. The results of analysis are summarized as follows. First, the main members of framework which handle a load burden on the long-rafter(長椽) are classified as the Jusim-dori(柱心道里) and the Oemok-dori(外目道里). Based on the method of handling a load, the eaves structure is classified into three types; the Jusim-processing-type(柱心中心形), the Oemok-processing-type(外目中 心形), and the Oemok-processing-variant-type(外目中心變異形). The Jusim-processing-type is the set where the internal length of a long-rafter is longer than the length of the eaves on the basis of the center of a column. The Oemok-processing-type is the set where the external length of a long-rafter is longer than the internal length of it. And the Oemok-processing-variant-type is the set where the internal length of a long-rafter is longer than the external length of it, but it is shorter than the length of the eaves which includes the extruded length of a Buyeon(浮椽). Second, the Jusim-processing-type had been generally adopted in the Jusimpo-type structure of the Goryeo Dynasty. But since the 17th century, the Oemok-processing-type had the highest application rate. Third, the change from the Jusimdori-processing-structure to the Oemokdori-processing-structure means that the long-rafter is moved to the direction of outside of the building, and thus the Jung-dori(中道里) is gradually moved to the column center. And, the change of the eaves with the Jusimpo-type structure was not a process for increasing the length of the eaves but a process for adopting the advantages of the Dapo-type structure by changing the arrangement of purlin. Fourth, the change from the Jusimpo-type structure to the Dapo-type structure could be understood as a process for moving the main point for handling a load from the Jusim-dori to the Oemok-dori.

• Journal of Communications and Networks
• /
• v.8 no.4
• /
• pp.442-450
• /
• 2006

Inter-operability between heterogeneous radio access technologies (RATs), in the sense of seamless vertical han-dover (VHO) support with common radio resource management (CRRM) functionalities, has recently attracted a significant research attention and has become a prominent issue in standardization fora. In this paper, we formulate the problem of load balancing between cooperative RAT's as a mathematical program and by trading off a pre-defined delay tolerance per request we propose a vertical handover batch processing (VHBP) scheme. To quantify the performance of the proposed VHBP scheme we compare it with a baseline processing scheme, where each VHO request is processed independently under a number of different network scenarios. Numerical investigations reveal significant net benefits of the proposed scheme compared with the baseline, both in terms of achieved load balancing levels but also with regard to the acceptance rate of the VHO requests.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.10 no.5
• /
• pp.13-19
• /
• 2011

In this paper, the active monitoring and control system is developed. This system can monitor the status of high the speed spindle in real time during its processing, and can analyze its influence of dimensional accuracy and processing if any, and can control the machining condition to realize the machining system equipped with active monitoring and self-diagnostic features. Machining experiment was performed on 3 materials Al, Brass and S45C in order to derive the relation between active monitoring and control algorithm by the machining load. In addition, we measured surface roughness of processing specimen along with the data change of spindle rotating speed and conveying speed according to variation of machining load. Based on these experiments, we derived relations for each material that can be applied to the control algorithm to allow self control of the rotating speed and conveying speed according to the machining load.

• The KIPS Transactions:PartA
• /
• v.10A no.4
• /
• pp.331-338
• /
• 2003

Cluster is the cost-effective parallel processing environment, and consists of the off-the-shelf computers connected by the computer net works. The characteristics of cluster are the node heterogeneity, the variety of node load, and the variety of network load. Because these characteristics influence the performance of parallel program executions, the load sharing for cluster is important, and by using the proper load sharing strategy, we can reduce the execution time of parallel programs. In this paper, we propose modified GSS algorithm, αGSS. In the proposed load sharing algorithms α GSS, the size of tasks are decided using the BogoMIPS of node. From the result of out experiments, we conclude that the proposed αGSS algorithm is effective in the heterogeneous cluster.

• Journal of Information Processing Systems
• /
• v.9 no.3
• /
• pp.365-378
• /
• 2013

In Wireless Mesh Networks (WMNs), we usually deploy multiple Internet Gateways (IGWs) to improve the capacity of WMNs. As most of the traffic is oriented towards the Internet and may not be distributed evenly among different IGWs, some IGWs may suffer from bottleneck problem. To solve the IGW bottleneck problem, we propose an efficient scheme to balance the load among different IGWs within a WMN. Our proposed load-balancing scheme consists of two parts: a traffic load calculation module and a traffic load migration algorithm. The IGW can judge whether the congestion has occurred or will occur by using a linear smoothing forecasting method. When the IGW detects that the congestion has occurred or will occur, it will firstly select another available IGW that has the lightest traffic load as the secondary IGW and then inform some mesh routers (MPs) which have been selected by using the Knapsack Algorithm to change to the secondary IGW. The MPs can return to their primary IGW by using a regression algorithm. Our Qualnet 5.0 experiment results show that our proposed scheme gives up to 18% end-to-end delay improvement compared with the existing schemes.

• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.2
• /
• pp.119-123
• /
• 2007

This paper investigates a speed sensorless control of induction motor. The control strategy is based on MRAS(Model Reference Adaptive System) using load-torque observer as a reference model for flux estimation. The speed response of conventional MRAS controller characteristics is affected by variations of load torque disturbance. In the proposed system, the speed control characteristics using a load-torque observer control isn't affected by a load torque disturbance. Control algorithm that propose whole system through MATLAB SIMULINK because do modelling simulation result are presented to prove the effectiveness of the adaptive sliding mode controller for the drive variable load of induction motor. Therefore we hope to be extended in industrial application.