• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.1_2
• /
• pp.1-14
• /
• 2006

Sort-last parallel rendering using a cluster of GPUs has been widely used as an efficient method for visualizing large- scale volume datasets. The performance of this method is constrained by load balancing when data parallelism is included. In previous works static partitioning could lead to self-balance when only task level parallelism is included. In this paper, we present a load balancing scheme that adapts to the characteristic of volume dataset when data parallelism is also employed. We effectively combine the hierarchical data structures (octree and BSP tree) in order to skip empty regions and distribute workload to corresponding rendering nodes. Moreover, we also exploit a 3D clustering method to determine visibility order and save the AGP bandwidths on each rendering node. Experimental results show that our scheme can achieve significant performance gains compared with traditional static load distribution schemes.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10c
• /
• pp.358-360
• /
• 2002

기존의 정적 부하균등화 기법들은 동적 객체의 내재된 부하와 서버득의 다양한 상태 변화에 따른 능동적 부하분배가 불가능하다. 이를 위해 각 서버에서 프로세스가 자원을 전유하는 비율에 따라 해당 서버의 부하량을 판단하는 새로운 부하할당 기법을 제안하였다. 각 서버의 더미 프로세스는 자신이 프로세서를 점유하는 시점마다 해당 서버의 ID만을 전달함으로써 부하에 따른 차등하게 비동기된 서버보고를 수행한다. 이를 통해 라 서버는 자신의 부하량에 비례하여 부하균등화 참여율을 조정하여 성능저하를 최소화하고 부하량 판단 정보로 활용한다. 결국 제안기법은 웹 서비스의 부하의 성향에 무관하게 지능적인 부하할당을 가능케 한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1B
• /
• pp.17-21
• /
• 2007

In this paper, we propose new on-line processor management algorithms that manage heterogeneous multimedia services while maximizing energy efficiency. These online management mechanisms are combined in an integrated scheme for higher system performance and energy efficiency. The most important feature of our proposed scheme is its adaptability, flexibility and responsiveness to current network conditions. Simulation results clearly indicate the superior performance of our proposed scheme to strike the appropriate performance balance between contradictory requirements.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.19 no.2
• /
• pp.107-114
• /
• 2024

Mobile ad hoc networks represent self-configuring networks of mobile devices that communicate without relying on a fixed infrastructure. However, traditional routing protocols in such networks encounter challenges in selecting efficient and reliable routes due to dynamic nature of these networks caused by unpredictable mobility of nodes. This often results in a failure to meet the low-delay and low-energy consumption requirements crucial for such networks. In order to overcome such challenges, our paper introduces a novel multi-objective and adaptive routing scheme based on the Q-learning reinforcement learning algorithm. The proposed routing scheme dynamically adjusts itself based on measured network states, such as traffic congestion and mobility. The proposed approach utilizes Q-learning to select routes in a decentralized manner, considering factors like energy consumption, load balancing, and the selection of stable links. We present a formulation of the multi-objective optimization problem and discuss adaptive adjustments of the Q-learning parameters to handle the dynamic nature of the network. To speed up the learning process, our scheme incorporates informative shaped rewards, providing additional guidance to the learning agents for better solutions. Implemented on the widely-used AODV routing protocol, our proposed approaches demonstrate better performance in terms of energy efficiency and improved message delivery delay, even in highly dynamic network environments, when compared to the traditional AODV. These findings show the potential of leveraging reinforcement learning for efficient routing in ad hoc networks, making the way for future advancements in the field of mobile ad hoc networking.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.2 no.1
• /
• pp.51-57
• /
• 2009

Blind equalization techniques have been widely used in wireless communication systems. In this paper, we investigate the information potentials in the criterion of minimizing Euclidian distance between two PDFs criterion for adaptive blind equalizers and evaluate BER performance of the method that has utilized an appropriate balance between the two information potentials, one from output samples and ramdomly generated desired samples at the receiver and another from the interactions among output samples. The balanced information potential method has shown in the BER performance results that it can produce significantly enhanced BER performance in blind equalization applications.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.7
• /
• pp.2354-2370
• /
• 2015

The advantages of employing SCTP-based Concurrent Multipath Transfer (CMT) have been demonstrated to be very useful for data delivery over multi-homed wireless networks. However, there is still significant ongoing work addressing some remaining limitations and challenges. The most important concern when applying CMT to data delivery is related to handling packet reordering and buffer blocking. Another concern on this topic is that current sender-based CMT solutions seldom consider balancing the overhead and sharing the load between the sender and receiver. This paper proposes a novel Receiver-driven Cooperation-based Concurrent Multipath Transfer solution (CMT-Rev) with the following aims: (i) to balance overhead and share load between the sender and receiver, by moving some functions including congestion and flow control from the sender onto receiver; (ii) to mitigate the data reordering and buffer blocking problems, by using an adaptive receiver-cooperative path aggregation model, (iii) to adaptively transmit packets over multiple paths according to their receiver-inspired sending rate values, by employing a new receiver-aware data distribution scheduler. Simulation results show that CMT-Rev outperforms the existing CMT solutions in terms of data delivery performance.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.2 no.2 s.3
• /
• pp.13-22
• /
• 2003

It is recognized that one of the problems for the current 'Traffic Adaptive Control System in Seoul' is the performance at the oversaturated condition. Instead of 'Degree of Saturation' adopted in the current system, the methodology of balancing the queue length was developed and evaluated in this study. This method keeps the balance of queue lengths on the intersections and reduces the overall queue lengths. In addition a traffic signal control model was developed based on the method. This model can reduce not only the queue lengths but also the average delay of vehicles according to the macroscopic and microscopic evaluations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.12
• /
• pp.2635-2643
• /
• 1997

In this paepr, a routing algorithm is proposed in order to reduce average end-to-end delay and congesting in the high speed network. The algorithm proposed here uses the existing one which adaptively modifies routes and the amount of traffic allocated to each link as user traffic partterns flutuate. This algorithm is ELB(Equitable Load Balancing). Also, the new algorithm considers the proportional to the distance between source and destination. It reduces congestion from the ELB and average end-to-end delay from the propagation dealy concepts respectively. Through the simulation, it shows that the algorithm proposed here reduces average end-to-end delay over low load to high load, and it also guarantees the congestion control.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.12
• /
• pp.247-255
• /
• 2011

Most existing clustering protocols have been aimed to provide balancing the residual energy of each node and maximizing life-time of wireless sensor networks. In this paper, we present the adaptive clustering strategy related to sink position for clustering protocols in wireless sensor networks. This protocol allows networks topology to be adaptive to the change of the sink position by using symmetrical clustering strategy that restricts the growth of clusters based on depth of the tree. In addition, it also guarantees each cluster the equal life-time, which may be extended compared with the existing clustering protocols. We evaluated the performance of our clustering scheme comparing to LEACH and EEUC, and observe that our protocol is observed to outperform existing protocols in terms of energy consumption and longevity of the network.

• Smart Structures and Systems
• /
• v.17 no.6
• /
• pp.957-980
• /
• 2016

Structural damage detection (SDD) is a challenging task in the field of structural health monitoring (SHM). As an exploring attempt to the SDD problem, a hybrid self-adaptive Firefly-Nelder-Mead (SA-FNM) algorithm is proposed for the SDD problem in this study. First of all, the basic principle of firefly algorithm (FA) is introduced. The Nelder-Mead (NM) algorithm is incorporated into FA for improving the local searching ability. A new strategy for exchanging the information in the firefly group is introduced into the SA-FNM for reducing the computation cost. A random walk strategy for the best firefly and a self-adaptive control strategy of three key parameters, such as light absorption, randomization parameter and critical distance, are proposed for preferably balancing the exploitation and exploration ability of the SA-FNM. The computing performance of the SA-FNM is evaluated and compared with the basic FA by three benchmark functions. Secondly, the SDD problem is mathematically converted into a constrained optimization problem, which is then hopefully solved by the SA-FNM algorithm. A multi-step method is proposed for finding the minimum fitness with a big probability. In order to assess the accuracy and the feasibility of the proposed method, a two-storey rigid frame structure without considering the finite element model (FEM) error and a steel beam with considering the model error are taken examples for numerical simulations. Finally, a series of experimental studies on damage detection of a steel beam with four damage patterns are performed in laboratory. The illustrated results show that the proposed method can accurately identify the structural damage. Some valuable conclusions are made and related issues are discussed as well.