• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.397-400
• /
• 2005

SM 프로젝트는 SI 프로젝트와 달리 고객의 요청 사항(CSR)이 있을 때 마다 개발 계획을 세우고 관리를 하여야 하며 동시에 고객의 개발 요청 내용 외에도 운영업무에 대한 계획도 같이 세워 져야 한다. 하지만 대부분의 SM 프로젝트에서는 한 두 사람의 경험이나 판단으로 계획이 작성, 할당되며 운영업무에 대한 계획의 정확도도 떨어져 업무 load balancing 이 잘 되지 않는다. 본 논문에서는 이러한 문제 해결을 위해 효과적인 SM 프로젝트에서의 EFFROT ESTIMATION 프로세스를 제안하여 업무 load balancing 을 이루는 방안을 제시하고자 한다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.46
• /
• pp.241-251
• /
• 1998

There are two methods of load balancing for detail scheduling : One method is to generate an initial schedule and obtain an improved final schedule by load balancing only during a specific period. The other method is to generate an initial schedule and obtain an improved schedule by load balancing from current date(TIMENOW) to unlimited time with the whole manufacturing processes. This paper proposes an algorithm for detail scheduling which can be a practical solution in job shop production or project job type by applying the former method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.8
• /
• pp.1259-1268
• /
• 2002

One of the major goals suggested in distributed system is to improve the performance of the system through the load balancing of whole system. Load balancing among systems improves the rate of processor utilization and reduces the turnaround time of system. In this paper, we design the rule of decision-making and information interchange based on knowledge based mechanism which makes optimal load balancing by sharing the future load state information inferred from past and present information of each nodes. The result of performance evaluation shows that utilization of processors is balanced, the processing time is improved and reliability and availability of systems are enhanced. The proposed mechanism in this paper can be utilized in the design of load balancing algorithm in distributed operating systems.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.4
• /
• pp.427-437
• /
• 1994

Optimal static load balancing in star network configurations is considered. Three kinds of load balancing direction strategies are considered. First, a job arriving at the peripheral nodes may be processed either where it arrived(origin node) or transferred directly to central node Second, a job arriving at the central node may be processed there, or transferred to lightly loaded peripheral nodes. A nonlinear optimization problem is formulated. Using the optimal solution, an optimal load balancing algorithm is derived for the second load balancing strategy. Third a job arriving at the central node or a peripheral node may be processed either at origin node or transferred to another lightly loaded node (central or peripheral). A load balancing algorithm is derived for the third load balancing strategy. The effects of these three load balancing strategies are compared by numerical experiments. During the conduct of these in numerical experiments, several interesting phenomena were observed. The third load balancing strategy improved performance more than the first two other strategies. The second load balancing strategy, as a whole, resulted in only slightly improved performance. Finally, of the central node has larger processing power than the peripheral nodes, the first and third load balancing strategies produce equal performance improvement.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.3
• /
• pp.288-298
• /
• 1995

Load balancing attempts to improve the performance of a distributed computing system by transferring some of the workload of a congested site to others. A load balancing scheme that supports both the source-initiated and the server- initiated load balancing is proposed in this paper. It can model both the m/m/1 queue(no load balancing) and the m/m/n queue(perfect load balancing) as the extreme State variables are replicated into every site, and copy consistency constraints are relaxed more weakly. We propose weak copy consistency constraints which correlate the outdated state information to that of the current state. We also derive sufficient conditions under which each scheduler can guarantee the load balancing without communication Using this model, the problem of load balancing is converted to that of maintaining the consistency of states and communication overhead becomes less than that of the bidding algorithm. The scheme is simulated by event tracing, compared to the two extreme cases and the bidding algorithm. The results show that the mean response time and the number of messages are reduced by 0-35% and 40-100% respectively, compared with the bidding algorithm. Finally the effects of some system parameters are described.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.249-250
• /
• 2008

In the field of mobile communications, load balancing between 3GPP LTE and other networks is expected to be an important topic from the perspective of current technical development. The load balancing technique includes the definition of functions and structures needed to incooperate 3G LTE E-Node B and base-stations designed for heterogeneous networks. The major goal attained from this paper is to ensure an algorithm for the mechanism of load balancing and to achieve a technical leading for the next generation mobile network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.6
• /
• pp.2035-2049
• /
• 2015

Applications deployed in cloud receive a huge volume of requests from geographically distributed users whose satisfaction with the cloud service is directly proportional to the efficiency with which the requests are handled. Assignment of user requests based on appropriate load balancing principles significantly improves the performance of such cloud-based applications. To study the behavior of such systems, there is a need for simulation tools that will help the designer to set a test bed and evaluate the performance of the system by experimenting with different load balancing principles. In this paper, a novel architecture for cloud called Request Assignment Simulator (RAS) is proposed. It is a customizable, visual tool that simulates the request assignment process based on load balancing principles with a set of parameters that impact resource utilization. This simulator will help to ascertain the best possible resource allocation technique by facilitating the designer to apply and test different load balancing principles for a given scenario.

• Journal of applied mathematics & informatics
• /
• v.14 no.1_2
• /
• pp.343-351
• /
• 2004

In order to maintain load balancing in a distributed system, we should obtain workload information from all the nodes on network. This processing requires $O(v^2)$ communication overhead, where v is the number of nodes. In this paper, we present a new synchronous dynamic distributed load balancing algorithm on a (v, k ＋ 1, 1)-configured network applying a symmetric balanced incomplete block design, where $v\;=\;k^2$\;＋\;k\;＋\;1$. Our algorithm needs only $O(\sqrt[v]{v})$ communication overhead and each node receives workload information from all the nodes without redundancy. Therefore, load balancing is maintained since every link has the same amount of traffic for transferring workload information.

• Journal of information and communication convergence engineering
• /
• v.2 no.2
• /
• pp.106-109
• /
• 2004

This study designs a load balancer via direct routing that share a virtual service on a single IP address in the Linux system and suggests an efficient load balancing method to improve transmission speed in the web server cluster environment. It will increase performance and scalability with fast packet transfer and removing bottleneck problem by using TCP Splicing and Content-Aware Distributor method. This method is expected to be the noticeable technology that provides an important interface, which make application services for e-commerce effectively be applied to high-speed network infrastructure. At this time, it is required to study further on the optimum balancing method in the web server cluster environment so as to apply the hybrid (optimum load balancing method by software and hardware) method and improve the reuse of security cession based on high-speed TCP connections.

• 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.