• The Transactions of the Korea Information Processing Society
• /
• v.7 no.4
• /
• pp.1290-1298
• /
• 2000

Multimedia Systems such as VOD(Video On Demand) and MOD (Multimedia On Demand) need to support continuous media operations which are randomly called by concurrent users and require that stored media be accessed in real-tim. To satisfy such a requirements, disk arrays consisting of multiple disks are generally used as storage systems. Under the real-time environments to provide users with accessing continuous media in the parallel and concurrent manner, storage systems should be able to deal with user requests independently. In this paper, we present a new fault-tolerant continuous media storage system called PADA(PRR\ulcorner bAsed Disk Array), which is based on a PRR\ulcorner (Prime Round Robin with Grouped Parties) disk placement scheme with enhanced reliability nd load-balancing. We have compared and evaluated the storage space overhead for fault-tolerance, the reliability of diks array systems, the degree of disk load0-balancing, the demanded buffer space, the maximum number of users being capable of supporting and the fault recovery overhead for PADA, RAID 5 and Declustered storage systems. According to the results, PADA is the best among them in that PADA satisfies load-balancing more effectively and servces more user in case of arbitrary-rate retrievals.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.31 no.10
• /
• pp.1-9
• /
• 2003

In GRID environments, an efficient load balancing algorithm should be adopted since the system performances of GRID system are not homogeneous. In this work, a new two-step mesh-partitioning scheme based on the graph-partitioning scheme was introduced to consider the difference of system performance. In the two-step mesh-partitioning scheme, the system performance weights were calculated to reflect the effect of heterogeneous system performances and WEVM(Weighted Edge and vertex Method) was adopted to minimize the increase' of communications. Numerical experiments were carried out in multi-cluster environment and WAN (Wide Area Network) environment to investigate the effectiveness of the two-step mesh-partitioning scheme.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.8
• /
• pp.486-494
• /
• 2006

In this paper, we introduce a new solution for the load balancing problem, an important issue in parallel processing. Our heuristic load balancing technique called MGA effectively combines the benefit of both mean-field annealing (MFA) and genetic algorithms (GA). We compare the proposed MGA algorithm with other mapping algorithms (MFA, GA-l, and GA-2). A multiprocessor mapping algorithm simulation has been developed to measure performance improvement ratio of these algorithms. Our experimental results show that our new technique, the composition of heuristic mapping methods improves performance over the conventional ones, in terms of solution quality with a longer run time.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.768-776
• /
• 1995

In a distributed computer system with star topology, the processing power of central node may be greater than that of peripheral nodes and the job arrival rate of each node may be different. The performance of load balancing may be very different according to the selection of sender criteria and receiver criteria for job transfer. But the optimal decision of sender and receiver criteria is very difficult in heterogeneous distributed computer systems. In this paper we propose effective destination decision policies using dynamic criteria such as mean job response time of a node and estimated response time of a job, instead of fixed threshold for dynamic load balancing.

• Journal of Information Processing Systems
• /
• v.7 no.1
• /
• pp.53-62
• /
• 2011

With the steady growth of mobile technology and applications, demand for more storage in mobile devices has also increased. A lightweight block-level protocol, Internet Advanced Technology Attachment (iATA), has been developed to deliver a cost-effective storage network solution for mobile devices to obtain more storage. This paper seeks to contribute to designing and implementing Load Balancing (LB), Network Monitoring (NM) and Write Replication (WR) modules to improve the protocol's scalability and data availability. LB and NM modules are invoked to collect system resources states and current network status at each associate node (server machine). A dynamic weight factor is calculated based on the collected information and sent to a referral server. The referral server is responsible to analyze and allocate the most ideal node with the least weight to serve the client. With this approach, the client can avoid connecting to a heavily loaded node that may cause delays in subsequent in-band I/O operations. Write replication is applied to the remaining nodes through a WR module by utilizing the Unison file synchronization program. A client initially connected to node IP A for write operations will have no hindrances in executing the relevant read operations at node IP B in new connections. In the worst case scenario of a node crashing, data remain recoverable from other functioning nodes. We have conducted several benchmark tests and our results are evaluated and verified in a later section.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.6
• /
• pp.529-534
• /
• 2017

In this paper, the implementation of proposed Automatic Load Balanced (ALB) PWM generation method is discussed. The conventional PWM generation method for cascade type H-bridge PWM converter causes the unbalance between each H-bridge converter, therefore the complex redundancy is required for the balancing of switching load of each converter, it consumes more computing power of controller. The ALB PWM method needs no additional switching redundancy for balancing, this paper discusses the implementation of ALB-PWM.

• Journal of Korea Multimedia Society
• /
• v.12 no.9
• /
• pp.1242-1251
• /
• 2009

A DSMS(Data Stream Management System) in ubiquitous environment processes huge data that input from a number of sensor. The existed system is used with a load shedding method that is eliminated with a part of huge data stream when it doesn't process the huge data stream. The Load shedding method has to filter a part of input data. This is because, data completeness or reliability is decreased. In this paper, we proposed the overload prediction load balancing to maintain data completeness when the system has an overload. The proposed method predicts the overload time. and than it is decreased with data loss when achieves the prediction overload time. The performance evaluation shows that the proposed method performs better than the existed method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4103-4121
• /
• 2018

Quality of Service (QoS) awareness is recognized as a key point for the success of Internet of Things (IOT).Realizing the full potential of the Internet of Things requires, a real-time task scheduling algorithm must be designed to meet the QoS need. In order to schedule tasks with diverse QoS requirements in cloud environment efficiently, we propose a task scheduling strategy based on dynamic priority and load balancing (DPLB) in this paper. The dynamic priority consisted of task value density and the urgency of the task execution, the priority is increased over time to insure that each task can be implemented in time. The scheduling decision variable is composed of time attractiveness considered earliest completion time (ECT) and load brightness considered load status information which by obtain from each virtual machine by topic-based publish/subscribe mechanism. Then sorting tasks by priority and first schedule the task with highest priority to the virtual machine in feasible VMs group which satisfy the QoS requirements of task with maximal. Finally, after this patch tasks are scheduled over, the task migration manager will start work to reduce the load balancing degree.The experimental results show that, compared with the Min-Min, Max-Min, WRR, GAs, and HBB-LB algorithm, the DPLB is more effective, it reduces the Makespan, balances the load of VMs, augments the success completed ratio of tasks before deadline and raises the profit of cloud service per second.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.4
• /
• pp.571-581
• /
• 2022

Wireless sensor networks use the concept of connected dominating sets that can form virtual backbones for effective routing and broadcasting. In this paper, we propose an optimization algorithm that configures a connected dominating sets in order to balance the load of nodes to increase network lifetime and to perform effective routing. The proposed optimization algorithm in this paper uses the metaheuristic method of tabu search algorithm, and is designed to balance the number of dominatees in each dominator in the constituted linked dominance set. By constructing load-balanced connected dominating sets with the proposed algorithm, it is possible to extend the network lifetime by balancing the load of the dominators. The performance of the proposed tabu search algorithm was evaluated the items related to load balancing on the wireless sensor network, and it was confirmed in the performance evaluation result that the performance was superior to the previously proposed method.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.6
• /
• pp.83-90
• /
• 2009

Since traffic is aggregated to a MPP that acts as an Internet gateway, if traffic load is not balanced among the MPPs in a WMN, the overall performance of a WMN becomes poor even though the total traffic load is far below the capacity of the WMN. Therefore, in this paper, we propose a stochastic load balancing scheme where each MP (Mesh Point) probabilistically selects its serving MPP according to the congestion levels of MPPs. Through extensive simulations using ns-2, we have verified that our scheme can stabilize a WMN fast when congestion occurs and reduce packet loss rate by distributing traffic load of a congested MPP to multiple MPPs in the inverse proportional to their congestion levels. Compared to queue-based load balancing scheme, our method can decrease network stabilization time by 34 seconds, and reduce packet loss rate by 7.6%. Since the proposed scheme can reduce network stabilization time by efficiently using network resource, it is expected to contribute to the reliable operation of a WMN.