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

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.209-210
• /
• 2006

Hierachical Mobile IPv6 (HMIPv6) solves Micro-mobility protocol problem about Handover. Mobility Anchor Point(MAP) helps reducing the handover, but this makes a load on the MAP. Besides the MAP operates this work everytime, and every Nodes. In this paper, we propose the algorithm that reduces the amount of Map working.

• Journal of Internet Computing and Services
• /
• v.12 no.3
• /
• pp.37-47
• /
• 2011

Current researches in the Cloud focus on the appropriate interactions of cloud components in a large-scale system implementation. However, the current designs do not include intelligent methods like grouping the similar service providers based on their properties and integrating adaptive schemes for load distribution which can promote effective sharing of resource. This paper proposes an efficient virtualization of services by grouping the cloud providers to improve the service provisioning. The grouping of cloud service providers based on a cluster analysis collects the similar and related services in one group. The adaptive load balancing supports the service provisioning of the cloud system where it manages the load distribution within the group using an adaptive scheme. The proposed virtualization mechanism (GRALB) showed good results in minimizing message overhead and throughput performance compared to other methods.

• Journal of the Korea Safety Management & Science
• /
• v.12 no.3
• /
• pp.101-106
• /
• 2010

The purposes of this paper are to investigate an effect of weight of material and gender on postural stability and to introduce formulas for those. There were five levels of weights 0, 9, 18, 27 and 36 kg, and two levels of genders were conducted. Eight male and five female subjects participated in this experiment, ten tests were performed for each level of weights to measure the postural stability by using the stability platform. The effect of the genders and the load on the postural stability were statistically analysed by the two way ANOVA test and the regression analysis. The ANOVA test showed that the effect of weights was statistically significant on postural stability to the both male and female subjects. And the postural stability of female subjects was better than that of male subjects. A linear regression formula for the balancing time and the load and a formula for the reduction rate postural stability and the relative load were introduced by the regression analysis.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.04a
• /
• pp.178-180
• /
• 2017

Virtualization was devised as a resource management and optimization technique for mainframes having scaleless computing capabilities. The resource scaling can be done with a variety of virtualization methods such as VM creation, deletion, and migration. In this paper, we designed to achieve the load balancing, several load balancing schemes such as Minimum Execution Time (MET), Min-Min scheduling, Cloud Analyst have been reported in literature in addition to a comprehensive study on First Come First Serve (FCFS) and Round-robin schedulers.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2014.07a
• /
• pp.337-340
• /
• 2014

클라우드 시스템이 큰 이슈로 떠오르면서 그 기반이 되는 분산 파일 시스템에 관한 연구가 계속되고 있다. 최근 제안된 분산파일 시스템은 대부분 확장 가능하며 신뢰성이 있는 시스템으로 구성되어 있으며 내고장성(Fault tolerance)과 높은 가용성을 위해 데이터 복제 기법을 사용하며 하둡 분산 파일 시스템에서는 블락의 복제수를 기본3개로 지정한다. 그러나 이 정책은 복제수가 많아지면 많아질수록 가용성은 높아지지만 스토리지 또한 증가한다는 단점이 있다. 본 논문에선 이러한 문제점을 해결하기 위해 최소한의 블락 복제수와 복제된 블락을 효율적으로 배치하여 더 좋은 성능과 부하분산(Load Balancing)하기 위한 기법을 제안한다.

• Journal of Korea Multimedia Society
• /
• v.11 no.7
• /
• pp.914-927
• /
• 2008

Grid database management systems are used for large data processing, high availability and data integration in grid computing. Furthermore the grid database management systems are in the use of manipulating the queries that are sent to distributed nodes for efficient query processing. However, when the query processing is concentrated in a random node, it will be occurred with imbalance workload and decreased query processing. In this paper we propose a load balancing method for query processing based on cache Management in grid databases. This proposed method focuses on managing a cache in nodes by cache manager. The cache manager connects a node to area group and then the cache manager maintains a cached meta information in node. A node is used for caching the efficient meta information which is propagated to other node using cache manager. The workload of node is distributed by using caching meta information of node. This paper shows that there is an obvious improvement compared with existing methods, through adopting the proposed algorithm.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.11
• /
• pp.22-35
• /
• 1999

The block assembly process takes more than half of the total shipbuilding processes. Therefore, it is very important to have a practically useful block assembly process planning system which can build plans of maximum efficiency with minimum man-hours required. However, the process plans are often not readily executable in the assembly shops due to severe imbalance of workloads. This problem arises because the process planning is done on block by block basis in current practice without paying any attention to the load distribution among the assembly shops. this paper presents the development of an automated hull block assembly process planning system which results in the most effective use of production resources and also produces plans that enable efficient time management. If the load balance of assembly shops is to be considered at the time of process planning, the task becomes complicated because of the increased computational complexity. To solve this problem, a new approach is adopted in this research in which the load balancing function and process planning function are iterated alternately providing to each other contexts for subsequent improvement. The result of case study with the data supplied from the shipyard shows that the system developed in this research is very effective and useful.

• Journal of Internet Computing and Services
• /
• v.5 no.1
• /
• pp.25-32
• /
• 2004

Mobile computing environment makes it possible for computing activities to be maintained during movement even if a user changes its network point of attachment. Mobile IP is a standard protocol designed to be used in such mobile computing environment. However, Mobile IP has a drawback to incur a lot of handoff delays and waste network resources, since CoA(Care of Address) registration packets need to go through a HA(Home Agent) first whenever a mobile node moves. To solve this long-standing problem, this paper proposes a new scheme that, for infra-domain movement, efficiently performs local handoff without notifying the HA Specifically, based on the notion of load balance, the proposed scheme allows every FA(Foreign Agent) in a domain to become the root FA(also known as domain FA) dynamically, thus distributing the registration task into many other foreign agents. The dynamic root assignment through load balancing ultimately leads to fast network response due to less frequent transmission of registration packets.

• Electronics and Telecommunications Trends
• /
• v.33 no.5
• /
• pp.42-50
• /
• 2018

UDN is expected to be a type of network capable of satisfying the requirements various 5G services, such as the peak data rate, connection density, and area traffic capacity. Technical challenges for 5G UDN, such as interference management, resource management, mobility management, load balancing, and energy efficiency are discussed. In addition, candidate technologies for solving these challenges, and their related standardization trends, are summarized in this article.