• ETRI Journal
• /
• v.30 no.4
• /
• pp.618-620
• /
• 2008

A distributed virtual environment (DVE) allows multiple geographically distributed objects to interact concurrently in a shared virtual space. Most DVE applications use a non-replicated server architecture, which dynamically partitions a virtual space. An important issue in this system is effective scalability as the number of users increases. However, it is hard to provide suitable load balancing because of the unpredictable movements of users and hot-spot locations. Therefore, we propose a mechanism for sharing roles and separating service regions. The proposed mechanism reduces unnecessary partitions of short duration and supports efficient load balancing.

• The Journal of Korean Academy of Prosthodontics
• /
• v.31 no.4
• /
• pp.580-610
• /
• 1993

The purpose of this study was to analyse the deflection and stress distribution at the supporting bone and it's superstructure by the alteration of angulation between implant and it's implant abutment. For this study, the free-end saddle case of mandibular first and second molar missing would be planned to restore with fixed prosthesis. So the mandibular second premolar was prepared for abutment, and the cylinder type osseointegrated implant was placed at the site of mandibular second molar for abutment. The finite element stress analysis was applied for this study. 13 two-dimensional FEM models were created, a standard model at $0^{\circ}$ and 12 models created by changing the angulation between implant and implant abutment as increasing the angulation mesially and distally with $5^{\circ}$ unittill $30^{\circ}$. The preprocessing decording, solving and postprocessing procedures were done by using FEM analysis software PATRAN and SUN-SPARC2GX. The deflections and von Mises stresses were calculated under concentrated load (load 1) and distributed load(load 2) at the reference points. The results were as follows : 1. Observing at standard model, the amount of total deflection at the distobuccal cusp-tip of pontic under concentrated load was largest of all, and that at the apex of implant was least of all, and the amount of total deflection at the buccal cusp-tip of second premolar under distributed load was largest of all, and that at the apex of implant was least of all. 2. Increasing the angulation mesially or distally, the amounts of total deflection were increased or decreased according to the reference points. But the order according to the amount of total deflection was not changed except apex of second premolar and central fossa of implant abutment under concentrated load during distal inclination. 3. Observing at standard model, the von Mises stress at the distal joint of pontic under concentrated load was largest of all, and that at the apex of implant was least of all. The von Mises stress at the distal margin of second premolar under distributed load was largest of all, and that at the apex of Implant was least of ail. 4. Increasing the angulation of implant mesially, the von Mises stresses at the mesial crest of implant were increased under concentrated load and distributed load, but those were increased remarkably under distributed load and so that at $30^{\circ}$ mesial inclination was largest of all. 5. Increasing the angulation of implant distally, the von Mises stresses at the distal crest of implant were increased remarkably under concentrated load and distributed load, and so those at $30^{\circ}$ distal inclination were largest of all.

• KIISE Transactions on Computing Practices
• /
• v.22 no.1
• /
• pp.44-49
• /
• 2016

Recently, data has been growing dramatically along with the growth of social media and digital devices. A distributed memory processing system has been used to efficiently process large amounts of data. However, if a load is concentrated in a certain node in distributed environments, a node performance significantly degrades. In this paper, we propose a load balancing scheme to distribute load in a distributed memory environment. The proposed scheme replicates hot data to multiple nodes for managing a node's load and migrates the data by considering the load of the nodes when nodes are added or removed. The client reduces the number of accesses to the central server by directly accessing the data node through the metadata information of the hot data. In order to show the superiority of the proposed scheme, we compare it with the existing load balancing scheme through performance evaluation.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2131-2136
• /
• 2003

Since the number of user-requests increases dramatically on the Internet, the servers and networks can be swamped unexpectedly without any prior notice. Therefore, the end-users are waiting or refused for the responses of the contents from the originating servers. To solve this problem, it has been considered that a distributed web caching system efficiently utilizes structural elements of the network. Because a distributed web caching system uses the caches that are close to end-users on the network, it transmits the contents to users faster than the original network system. This paper proposes a simple client-based distributed web caching system(2HRCS) that client can directly perform object allocation and load balancing without an additional DNS for load balancing in CARP (Cache Array Routing Protocol) and GHS (Global Hosting System) that are the recent distributed web caching system protocol. The proposed system reduces the cost of setup and operation by removing DNS that needs to balance the load in the existing system. The system has clients with consistent hashing method, so it extends its environment to other distributed web caching system that has caches of different capacity. A distributed web caching system is composed and tested to evaluate the performance. As a result, it shows superior performance to consistent hashing system. Because this system can keep performance of the existing system and reduce costs, it has the advantage of constructing medium or small scale CDN (Contents Delivery Network).

• The Journal of the Korea Contents Association
• /
• v.16 no.7
• /
• pp.667-680
• /
• 2016

As distributed computing platforms like Hadoop MapReduce have been developed, it is necessary to perform the conventional query processing techniques, which have been executed in a single computing machine, in distributed computing environments efficiently. Especially, studies on similarity join query processing in distributed computing environments have been done where similarity join means retrieving all data pairs with high similarity between given two data sets. But the existing similarity join query processing schemes for distributed computing environments have a problem of skewed computing load balance between clusters because they consider only the data transmission cost. In this paper, we propose Matrix-based Load-balancing Algorithm for efficient similarity join query processing in distributed computing environment. In order to uniform load balancing of clusters, the proposed algorithm estimates expected computing cost by using matrix and generates partitions based on the estimated cost. In addition, it can reduce computing loads by filtering out data which are not used in query processing in clusters. Finally, it is shown from our performance evaluation that the proposed algorithm is better on query processing performance than the existing one.

• Earthquakes and Structures
• /
• v.5 no.6
• /
• pp.625-655
• /
• 2013

This paper investigated the seismic behaviour of an innovated non-ductile precast concrete wall structural system; namely HC Precast System (HCPS). The system comprises load-bearing precast wall panels merely connected only to column at both ends. Such study is needed because there is limited research information available in design codes for such structure particularly in regions having low to moderate seismicity threats. Experimentally calibrated numerical model of the wall system was used to carry out nonlinear pushover analyses with various types of lateral loading patterns. Effects of laterally applied single point load (SPL), uniformly distributed load (UDL), modal distributed load (MDL) and triangular distributed load (TDL) onto global behaviour of HCPS were identified. Discussion was focused on structural performance such as ductility, deformability, and effective stiffness of the wall system. Thus, a new method for engineers to estimate the nonlinear deformation of HCPS through linear analysis was proposed.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.11
• /
• pp.179-185
• /
• 2004

The effect of viscous damping on stability of beam resting on an elastic foundation subjected to a dry friction force is analytically studied. The beam resting on an elastic foundation subjected to dry friction force is modeled for simplicity into a beam resting on Kelvin-Voigt type foundation subjected to distributed follower load. In particular, the effects of four boundary conditions (clamped-free, clamped-pinned, pinned-pinned, clamped-clamped) on the system stability are considered. The critical value and instability type of columns on the elastic foundation subjected to a distributed follower load is investigated by means of finite element method for four boundary conditions. The elastic foundation modulus, viscous damping coefficient and boundary conditions affect greatly both the instability type and critical load. Also, the increase of damping coefficient raises the critical flutter load (stabilizing effect) but reduces the critical divergence load (destabilizing effect).

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.6
• /
• pp.67-73
• /
• 2012

A distributed conference architecture with a new load control method has been suggested in this paper. A new event package in this paper enables to control conference load. Some additional elements for exchanging SIP messages between server and participants, and for distributing the load, have been added to new conference information data format. Furthermore to lessen the load, all conference servers share the processing of conference information data which should be transferred periodically to all participants. The suggested load control event package makes each server can get current load status of the overall servers. When load increases in one server SIP client requests are distributed by selecting a server which has the lowest load value, or new server is created to share the load. The performance of the proposed system has been evaluated by experiments. They shows 21.6% increase in average delay time, and 29.2% increase in average SIP message processing time.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.19 no.8
• /
• pp.70-76
• /
• 2005

Unlike the large sized generations of transmission system, the distributed generations have complexities in analyzing and determining model. This paper resents an analytical method for the reliability evaluation of distribution system, including the distributed generations. The method using Load Duration Curve model is simpler than the Monte-Carlo Simulation and is more accurate than that using peak load model. The modeling of distributed generation to analysis reliability of customers using LDC is proposed in this paper, and is compared with the MCS method as a result of case studies.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.314-317
• /
• 2000

Cluster system provides attractive scalability in terms of computation power and memory size. With the advances in high speed computer network technology, cluster systems are becoming increasingly competitive compared to expensive parallel machines. In parallel processing program, each task load is difficult to predict before running the program and each task is interdependent each other in many ways. Load imbalancing induces an obstacle to system performance. Most of researches in load balancing were concerned with distributed system but researches in cluster system are few. In cluster system, the dynamic load balancing algorithm which evaluates each processor's load in runtime is purpose that the load of each node are evenly distributed. But, if communication cost or node complexity becomes high, it is not effective method for all nodes to attend load balancing process. In that circumstances, it is good to reduce the number of node which attend to load balancing process. We have modeled cluster systems and proposed marginal dynamic load balancing algorithms suitable for that circumstances.