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

• Journal of the Korea Computer Graphics Society
• /
• v.1 no.2
• /
• pp.213-225
• /
• 1995

3 차원 볼륨 데이터를 시각화(visualization)하기 위해서는 많은 계산 량과 메모리 량을 필요로 한다. 단일컴퓨터에서 순차 알고리즘을 이용하여 데이터를 시각화하고 분석하는 것은 실시간 응용 프로그램에는 부적합하다. 기존의 병렬 볼륨 렌더링에서의 데이터 분할 방법은 대부분 정적 로드 밸런싱(static load balancing)에 기반하고 있다. 동적 로드 밸런싱에 기반한 기존의 방법들은 불륨 데이터의 정규성(regularity)을 이용할 수 없다는 단점이 있다. 본 연구에서는 3 차원 볼륨 데이터에 대하여 로컬 태스크 큐(local task queue) 기법에 기반한 새로운 로드밸런싱 알고리즘을 제안한다. 제안한 방법은 계산에 참여할 노드(node)들을 PVM(parallel virtual machine)의 동적 프로세스 그룹(dynamic process group: DPG)을 이용하여 정적으로 그룹화(grouping)한다. 각각의 DPG들은 로컬 태스크 큐를 기반으로 단위 서브-블록에 대하여 동적 로드 밸런싱을 수행한다. 최적화된 레이 캐스팅 알고리즘들을 분산 환경에 새롭게 적용함으로써 로드 밸런싱으로 생길 수 있는 오버 헤드를 최소화하였다.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.12
• /
• pp.148-161
• /
• 1998

We investigate a design methodology for master arm which is employed in remote-site control. Though counter-balancing has been employed for the purpose of lessening the actuator loads, it results in the increase of dynamic load at the task position. Therefore, there exists a trade-off between counter-balancing and dynamic performance. The concept of a composite index is introduced to simultaneously consider those two effects in the design of master arms. Several alternative designs of master arms are suggested.

• Journal of Institute of Control, Robotics and Systems
• /
• v.21 no.9
• /
• pp.863-868
• /
• 2015

In this paper, the vibration of a single-wheel mobile robot is minimized by designing a filter. An AHRS (Attitude and heading reference system) sensor is used for measuring the state of the robot. The measured signals are analyzed using the FFT method to investigate the fundamental vibrational frequency with respect to the flywheel's speed of the gimbal system. The IIR notch filter is then designed to suppress the vibration at the identified frequency. After simulating the performance of the designated filter using the measured sensor data through extensive experiments, the filter is actually implemented in a single-wheel mobile robot, GYROBO. Finally, the performance of the designed filter is confirmed by performing the balancing control task of the GYROBO system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.414-435
• /
• 2017

As network adaptive streaming technology becomes increasingly common, transport protocol also becomes important in guaranteeing the quality of multimedia streaming. At the same time, because of the appearance of high-quality video such as Ultra High Definition (UHD), preventing buffering as well as preserving high quality while deploying a streaming service becomes important. The Internet Engineering Task Force recently published Multipath TCP (MPTCP). MPTCP improves the maximum transmission rate by simultaneously transmitting data over different paths with multiple TCP subflows. However, MPTCP cannot preserve high quality, because the MPTCP subflows slowly increase the transmission rate, and upon detecting a packet loss, drastically halve the transmission rate. In this paper, we propose a new multipath congestion control scheme for high-quality multimedia streaming. The proposed scheme preserves high quality of video by adaptively adjusting the increasing parameter of subflows according to the network status. The proposed scheme also increases network efficiency by providing load balancing and stability, and by supporting fairness with single-flow congestion control schemes.

• Journal of Korean Institute of Industrial Engineers
• /
• v.17 no.2
• /
• pp.51-61
• /
• 1991

This paper presents a heuristic method for the Assembly Line Balancing(ALB) of the large-sized product. In the ALB problem of the large-sized product such as bus and truck, the assignments of the Related Task Groups(RTG), the same side tasks, and team tasks should be considered. In this paper, a new concept of the RTG and two kinds of assignment rules are proposed to resolve the above considerations. The first assignment rule allots the RTG with the constraint of the same side tasks to the station while the second allots the RTG to the station, relaxing the above constraint to increase the applicability of the method. An assignment rule for team tasks is also presented. The benefits of the method are to improve work methods, to give more job satisfaction to workers, and to allow greater flexibility in the design of assembly lines.

• International Journal of Computer Science & Network Security
• /
• v.23 no.10
• /
• pp.73-80
• /
• 2023

The recent growth in the use of mobile devices has contributed to increased computing and storage requirements. Cloud computing has been used over the past decade to cater to computational and storage needs over the internet. However, the use of various mobile applications like Augmented Reality (AR), M2M Communications, V2X Communications, and the Internet of Things (IoT) led to the emergence of mobile cloud computing (MCC). All data from mobile devices is offloaded and computed on the cloud, removing all limitations incorporated with mobile devices. However, delays induced by the location of data centers led to the birth of edge computing technologies. In this paper, we discuss one of the edge computing technologies, i.e., cloudlet. Cloudlet brings the cloud close to the end-user leading to reduced delay and response time. An algorithm is proposed for scheduling tasks on cloudlet by considering VM's load. Simulation results indicate that the proposed algorithm provides 12% and 29% improvement over EMACS and QRR while balancing the load.

• Journal of the Semiconductor & Display Technology
• /
• v.23 no.2
• /
• pp.23-27
• /
• 2024

Underwater images are typically degraded due to color distortion, light absorption, scattering, and noise from artificial light sources. Restoration of these images is an essential task in many underwater applications. In this paper, we propose a two-phase deep learning-based method, Underwater Deep Curve Estimation (UWDCE), designed to effectively enhance the quality of underwater images. The first phase involves a white balancing and color correction technique to compensate for color imbalances. The second phase introduces a novel deep learning model, UWDCE, to learn the mapping between the color-corrected image and its best-fitting curve parameter maps. The model operates iteratively, applying light-enhancement curves to achieve better contrast and maintain pixel values within a normalized range. The results demonstrate the effectiveness of our method, producing higher-quality images compared to state-of-the-art methods.

• ETRI Journal
• /
• v.34 no.3
• /
• pp.330-340
• /
• 2012

In many applications of wireless sensor actor networks (WSANs) that often run in harsh environments, the reduction of completion times of tasks is highly desired. We present a new time-aware, energy-aware, and starvation-free algorithm called Scate for assigning tasks to actors while satisfying the scalability and distribution requirements of WSANs with semi-automated architecture. The proposed algorithm allows concurrent executions of any mix of small and large tasks and yet prevents probable starvation of tasks. To achieve this, it estimates the completion times of tasks on each available actor and then takes the remaining energies and the current workloads of these actors into account during task assignment to actors. The results of our experiments with a prototyped implementation of Scate show longer network lifetime, shorter makespan of resulting schedules, and more balanced loads on actors compared to when one of the three well-known task-scheduling algorithms, namely, the max-min, min-min, and opportunistic load balancing algorithms, is used.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.5
• /
• pp.153-160
• /
• 2015

The effectiveness of multicores depends on how well a scheduler can assign tasks onto the cores efficiently. In a heterogeneous multicore platform, the execution time of an application depends on which core it executes on. That is to say, the effectiveness of task assignment is one of the important components for a multicore systems' performance. This work proposes a load scheduling technique that analyzes execution time of each task by profiling. The profiling result provides a basic information to predict which task-to-core mapping is likely to provide the best performance. By using such information, the proposed technique is about 26% performance gain.