• Proceedings of the KIEE Conference
• /
• 1991.07a
• /
• pp.748-752
• /
• 1991

Tree network consisting of communicating processors is considered. The objective is to minimize the computation time by distributing the processing load to other nodes. The effect of the order of load distribution on the processing time is addressed. An algorithm which optimally determines the order of load distribution is developed. It is shown that the order depends only on the channel capacity between nodes but not on the computing capability of each node.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.5
• /
• pp.177-188
• /
• 2018

The scale of graph data has been increased rapidly because of the growth of mobile Internet applications and the proliferation of social network services. This brings upon the imminent necessity of efficient distributed and parallel graph processing approach since the size of these large-scale graphs are easily over a capacity of a single machine. Currently, there are two popular parallel graph processing approaches, vertex-centric graph processing and block centric processing. While a vertex-centric graph processing approach can easily be applied to the parallel processing system, a block-centric graph processing approach is proposed to compensate the drawbacks of the vertex-centric approach. In these systems, the initial quality of graph partition affects to the overall performance significantly. However, it is a very difficult problem to divide the graph into optimal states at the initial phase. Thus, several dynamic load balancing techniques have been studied that suggest the progressive partitioning during the graph processing time. In this paper, we present a load balancing algorithms for the block-centric graph processing approach where most of dynamic load balancing techniques are focused on vertex-centric systems. Our proposed algorithm focus on an improvement of the graph partition quality by dynamically reassigning blocks in runtime, and suggests block split strategy for escaping local optimum solution.

• Journal of Internet Computing and Services
• /
• v.3 no.6
• /
• pp.53-61
• /
• 2002

This paper propose an dynamic load balancing algorithm for heterogeneous distributed systems. The algorithm allows this tasks to be relocated. The key of the algorithm is to transfer a suitable amount of processing demand from senders to receivers. This amount is determined dynamically during sender-receiver negotiations. Factors considered when this amount is determined include processing speeds of different nodes, the current load state of both sender and receiver, and the processing demands of tasks eligible for relocation. This paper also propose a load state measurement scheme which is designed particularly for heterogeneous systems. This results of the study show that the proposed algorithm outperforms the existing algorithms and is stable over a range of system attributes.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.12
• /
• pp.3456-3468
• /
• 1999

Most of previous parallel join algorithms assume a database partition system(DPS), where each database partition is owned by a single processing node. While the DPS is novel in the sense that it can interconnect a large number of nodes and support a geographically distributed environment, it may suffer from poor facility for load balancing and system availability compared to the database sharing system(DSS). In this paper, we propose a dynamic load balancing strategy by exploiting the characteristics of the DSS, and then extend the conventional hash join algorithms to the DSS by using the dynamic load balancing strategy. With simulation studies under a wide variety of system configurations and database workloads, we analyze the effects of the dynamic load balancing strategy and differences in the performances of hash join algorithms in the DSS.

• Computers and Concrete
• /
• v.33 no.1
• /
• pp.41-53
• /
• 2024

Under constant and cyclic axial compression, square composite short columns reinforced with Self Compacting Concrete (SCC) added with scrap rubber infilled inside steel tubes and with different types of concrete were cast and tested. The test is carried out to find the effectiveness of utilizing an aggregate manufactured from industrial waste and to address the problems associated with the need for alternative reinforcements along with waste management. The main testing parameters are the type of concrete, the effect of fiber inclusion, and the significance of rubber-infilled steel tubes. The failure modes of the columns and axial load-displacement curves of the steel tube-reinforced columns were all thoroughly investigated. According to the test results, all specimens failed due to compression failure with a longitudinal crack along the loading axis. The fiber-reinforced column specimens demonstrated improved ductility and energy absorption. In comparison to the normal-weight concrete columns, the lightweight concrete columns significantly improved the axial load-carrying capacity. The addition of basalt fiber to the columns significantly increased the yield stress and ultimate stress to 9.21%. The corresponding displacement at yield load and ultimate load was reduced to 10.36% and 28.79%, respectively. The precision of volumetric information regarding the obtained crack quantification, aggregates, and the fiber in concrete is studied in detail through image processing using MATLAB environment.

• International Journal of Contents
• /
• v.3 no.1
• /
• pp.34-38
• /
• 2007

Load redistribution is a critical resource in computer system. In sender-initiated load redistribution algorithms, the sender continues to send unnecessary request messages for load transfer until a receiver is found while the system load is heavy. 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 load redistribution in distributed systems. Compared with the conventional sender-initiated algorithms, the proposed algorithm decreases the response time and task processing time.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.1431-1434
• /
• 2007

시스템의 한정된 자원을 다수의 사용자들이 프로그램 실행 시 자원을 효율적으로 배분하기 위하여 작업관리 시스템을 이용한다. IBM 시스템은 작업관리 시스템으로서 주로 LoadLeveler를 사용한다. LoadLeveler에서의 메모리 관리는 WLM(Workload Manager)에서 설정하며, WLM의 환경 설정에 따라 작업의 실행에 많은 영향을 받는다. 본 논문에서는 WLM의 환경 설정에 의한 LoadLeveler에서의 작업을 실행하면서 메모리 변화와 실행 시간을 측정하고 분석하였다. 따라서 시스템의 특성과 사용자 작업에 알맞은 최적의 WLM 환경을 적용함으로써 시스템의 안정성을 유지하고 전체 작업처리 효율을 증가시켰다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.04a
• /
• pp.381-384
• /
• 2002

This paper describes the motivation, design and performance of bi-active Load balancer in Linux Virtual Server. The goal of bi-active Load balancer is to provide a framework to build highly scalable, fault-tolerant services using a large cluster of commodity servers. The TCP/IP stack of Linux Kernel is extended to support three IP load balancing techniques, which can make parallel services of different kinds of server clusters to appear as a service on a single IP address. Scalability is achieved by transparently adding or removing a node in the cluster. and high availability is provided by detecting node or daemon failures and reconfiguring the system appropriately. Extensive simulation reveals that the proposed approach improves the reply rate about 20% compared to earlier design.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.576-578
• /
• 2014

하나의 시스템을 다수의 사용자가 사용하는 경우 한정된 시스템의 자원을 효율적으로 배분하기 위하여 작업관리 시스템을 사용한다. 이러한 작업관리 시스템은 여러가지 종류가 있으며 시스템의 특성과 사용의 작업 패턴을 고려하여 적당한 작업관리 시스템을 선택하여 사용한다. IBM 시스템은 자체로 제공하는 작업관리 시스템인 LoadLeveler 주로 사용하고 있으며, 최근에는 몇가지 기능이 향상된 LSF를 이용하는 추세이기도 하다. 작업관리 시스템의 LoadLeveler에서는 CPU 수에 따라서 작업 우선 순위를 부여하고자 할 때 이러한 기능을 할 수 있는 환경 변수가 제공되지 않는데, 이러한 LoadLeveler의 환경에서 시스템의 환경파일에 스크립트 프로그램으로 이러한 기능을 구현하여 CPU 수에 따른 작업 우선순위를 적용함으로서 시스템 전체의 처리 효율을 향상 할 수 있게 하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.04a
• /
• pp.249-251
• /
• 2014

This paper proposes a channel diversity based load-balancing cross-layer routing scheme for Wireless Mesh Networks (WMNs). The proposed scheme deals with channel diversity phase and load balancing phase in WMNs. Channel diversity factor $metric_{ch-d}$ and load balancing factor $f_{load}$ are defined and employed cooperatively as a combined path selection policy.