• International Journal of Contents
• /
• v.2 no.1
• /
• pp.39-44
• /
• 2006

Load sharing is a critical resource in computer system. In sender-initiated load sharing algorithms, the sender continues to send unnecessary request messages for load transfer until a receiver is found while the system load is heavy. Meanwhile, in the receiver initiated load sharing algorithms, the receiver continues to send an unnecessary request message for load acquisition until a sender is found while the system load is light. These unnecessary request messages result in inefficient communications, low CPU utilization, and low system throughput in distributed systems. To solve these problems, we propose a genetic algorithm based approach for improved sender-initiated and receiver-initiated load sharing in distributed systems. And we expand this algorithm to an adaptive load sharing algorithm. Compared with the conventional sender-initiated and receiver-initiated algorithms, the proposed algorithm decreases the response time and task processing time.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.2
• /
• pp.298-305
• /
• 2010

In this paper, a new algorithm of optimal Volt/Var Control is proposed using Volt/Var control for the Distribution Automation System (DAS) with Distributed Generation (DG) based on the modeling of the distributed load and the distributed current. In the proposed, algorithm based on the modeling of the distributed load and the distributed current are estimated from constants of four terminals using the measurement of the current and power factor from a Feeder Remote Terminal Unit (FRTU) and DG data from RTU for DG. For the optimal Volt/Var Control, the gradient method is applied to find optimal solution for tap, capacity and power control of OLTC (On-Load Tap Changers), SVR (Step Voltage Regulator), PC (Power Condenser) and DG (Distributed Generation). In the case studies, the estimation and control of the voltages have been testified in a radial distribution system with DG using matlab program.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.13 no.4
• /
• pp.153-162
• /
• 2017

Advances in communication technologies and the decreasing cost of computers have made distributed computer systems an attractive alternative for satisfying the information needs of large organizations. This paper presents a distributed algorithm for performance improvement through load balancing and file migration in distributed systems. We employed a sender initiated strategy for task migration and used learning automata with several internal states for file migration. A task can be migrated according to the load information of a computer. A file is migrated to the destination processor when it is in the right boundary state. We also described an analytical model for load balancing with file migration to verify the proposed algorithm. Analytical and simulation results show that our algorithm is very well-suited for distributed system environments.

• The Journal of Korean Academy of Prosthodontics
• /
• v.29 no.2
• /
• pp.147-160
• /
• 1991

The purpose of this study was to examine, by the method of finite element analysis, how implant geometry with or without connection between natural tooth and osseointegrated abutments affected the stress distribution in surrounding bone and osseointegrated prosthesis. The mandibular first and second molars were removed and the two osseointegrated implants were placed in the first and second molar sites. Stress analysis induced by prostheses with connection(Model A)or without connection(Model B) between natural tooth(second bicuspid) and two osseointegrated abutments(first molar and second molar) was performed under vertical point load(Load P1) or distributed point load(Load P2). The results were as follows; 1. Under vertical point load, mesial tilting was shown in both Model A and Model B and inferior displacement of Model A was greater than that of Model B in the second bicuspid. 2. Under vortical point load, the first and second molars showed mesial tilting in both Model A and Model B, and inferior displacement of them was similar in Model A and Model B and was less than that of the second bicuspid. 3. Under distributed point load, mesial displacement was shown in Model A and Model B and inferior displacement of Model A was less than that of Model B in the second bicuspid. 4. Under distributed point load, mesial tilting was shown and inferior displacement of Model A was similar to that of Model B in the first and second molars. 5. In Model A under vertical point load, high stress was concentrated in the corneal portion of first molar and distributed throughout the second molar and the second bicuspid, and the stress distribution of the second molar was greater than that of the second bicuspid. 6. In Model B under vertical point load, high stress was concentrated in the coronal and mesio-cervical portion of the first molar. 7. In Model A under distributed point load, high stress was concentrated in the mesio-cervical portion of the first molar and evenly distributed throughout the second molar and the second bicuspid. 8. In Model B under distributed point load, high stress was concentrated in the disto-cervical portion of the second bicuspid and evenly distributed throughout the first and second molars.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.11C
• /
• pp.1040-1045
• /
• 2002

This paper focuses on a hash-based, distributed Wet caching network that eliminates inter-cache communication. An agent program on cache servers, a mapping program on the DNS server, and other components comprised in a distributed Web caching network were modified and developed to implement a so-called "consistent" hashing. Also, a dynamic load balancing algorithm is proposed to address the load-balancing problem that is a key performance issue on distributed architectures. This algorithm effectively balances the load among cache servers by distributing the calculated amount of mapping items that have higher popularity than others. Therefore, this developed network can resolve the imbalanced load that is caused by a variable page popularity, a non-uniform distribution of a hash-based mapping, and a variation of cache servers.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.7
• /
• pp.714-719
• /
• 2011

This paper proposes a scheme for distributed load balancing in mobile communication networks based on supervisory control framework. Using load information exchanged with neighboring cells, the "supervisors" that reside in the base stations distribute load among cells by controlling handover parameters in a distributed manner. The supervisors are designed so that the load difference among neighboring cells are kept under a pre-defined value. Results from systematic analysis and simulation indicate that our scheme effectively balances traffic load among cells and reduces call blocking rate of the overloaded cells.

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

• Journal of The Korean Society of Agricultural Engineers
• /
• v.46 no.6
• /
• pp.21-28
• /
• 2004

This study aims to investigate the effects of partially distributed loads on the dynamic behaviour of steel parabolic arches by using the elasto-plastic finite element model based on the Von Mises yield criteria and the Prandtl-Reuss How rule. For this purpose, the vertical and the radial load conditions were considered as a distributed loading and the loading range is varied from 40% to 100% of arch span. Normal arch and arch with initial deflection were studied. The initial deflection of arch was assumed by the sinusoidal motile of ${\omega}_i\;=\;{\\omega}_O$ sin ($n{\pi}x/L$). Several numerical examples were tested considering symmetric initial deflection when the maximum initial deflection at the apex is fixed as L/1000. The analysis resluts showed that the maximum deflection at the apex of arch was occurred when 70% of arch span was loaded. The maximum deflection at the quarter point of arch span was occurred when 50% of arch span was loaded. It is known that the optimal rise to span ratio between 0.2 and 0.3 when the vertical or radial distributed load is applied. It is verified that the influence of initial deflection of radial load case is more serious than that of vertical load case.

• Advances in materials Research
• /
• v.5 no.1
• /
• pp.1-9
• /
• 2016

The bending problem of a functionally graded cantilever beam subjected to uniformly distributed load is investigated. The material properties of the functionally graded beam are assumed to vary continuously through the thickness, according to a power-law distribution of the volume fraction of the constituents. First, the partial differential equation, which is satisfied by the stress functions for the axisymmetric deformation problem is derived. Then, stress functions are obtained by proper manipulation. A practical example is presented to show the application of the method.

• Journal of the Korea Society for Simulation
• /
• v.2 no.1
• /
• pp.91-106
• /
• 1993

Load sharing in distributed systems improves systems performance. Research in the field has been focused on steady state performance for load sharing algorithms. However, transient characteristics of such algorithms may be important in a distributed system in which workload for some node is changing. Simulation is the only means to analyze such characteristics. This paper presents a simulation-based analysis of the transient characteristics of four load sharing algorithms ; forward probing, reverse probing, symmetric probing, and multi-threshold symmetric probing algorithms. Discrete event system models for execution of the algorithms in a distributed system has been developed in a SIMSCRIOT II.5 environment. Simulation results indicate that the MSYM algorithm shows the shortest response time in the transient period.