• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.7
• /
• pp.429-439
• /
• 2006

A desktop grid, which is a computing grid composed of idle computing resources in a large network of desktop computers, is a promising platform for compute-intensive distributed computing applications. However, due to reliability and unpredictability of computing resources, effective scheduling of parallel computing applications on such a platform is a difficult problem. This paper proposes a new scheduling method aimed at reducing the total execution time of a parallel application on a desktop grid. The proposed method is based on utilizing the histories of execution behavior of individual computing nodes in the scheduling algorithm. In order to test out the feasibility of this idea, execution trace data were collected from a set of 40 desktop workstations over a period of seven weeks. Then, based on this data, the execution of several representative parallel applications were simulated using trace-driven simulation. The simulation results showed that the proposed method improves the execution time of the target applications significantly when compared to previous desktop grid scheduling methods. In addition, there were fewer instances of application suspension and failure.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.9
• /
• pp.1060-1068
• /
• 2016

The range-free localization using connectivity information has problems of mobile tracking. This paper proposes two Bayesian filter-based mobile tracking algorithms considering a propagation scenario. Kalman and Markov Chain Monte Carlo (MCMC) particle filters are applied according to linearity of two measurement models. Measurement models of the Kalman and MCMC particle filter-based algorithms respectively are defined as connectivity between mobiles, information fusion of connectivity information and received signal strength (RSS) from neighbors within one-hop. To perform the accurate simulation, we consider a real indoor map of shopping mall and degree of radio irregularity (DOI) model. According to obstacles between mobiles, we assume two types of DOIs. We show the superiority of the proposed algorithm over existing range-free algorithms through MATLAB simulations.

• Proceedings of the Korea Contents Association Conference
• /
• 2018.05a
• /
• pp.537-538
• /
• 2018

이 논문에서는 CDP (Continuous Data Protection)에서 연속적인 데이터 보존 및 복원을 위한 파일시스템 변경 로그 레코드 색인 방법을 제안한다. 제안하는 파일시스템 변경 로그 레코드 색인 방법은 CDP에서 특정 시점의 파일들에 대한 복원 속도를 향상시키는 것이 목적이다. 제안하는 방법은 각 파일들을 논리적인 청크 (chunk) 단위로 나누고 각 청크에 대해서 일정 시간대별로 비트를 할당하여 파일의 변경을 추적하는 비트맵 (bitmap) 기반의 색인이다. 제안하는 비트맵 기반의 색인 방법은 멀티 레벨로 구성하여 비트맵 연산의 횟수를 줄일 수 있도록 한다. 이 논문에서는 제안하는 비트맵 기반의 색인 방법의 효율성을 입증하기 위해서 시뮬레이션을 수행한다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2024.01a
• /
• pp.407-410
• /
• 2024

본 논문에서는 Semi-Lagrangian 이류 과정에서 역추적(Backward tracing)한 위치의 주변 속도를 Divergence-constrained MLS(Moving least squares)를 이용하여 보간하고 그 결과를 이류된 속도 데이터의 외력으로 적용해 연기 시뮬레이션의 난류 표현을 개선할 수 있는 새로운 프레임워크를 제안한다. 일반적인 MLS는 고차보간법이기 때문에 시간에 따른 연속성 보장이 안 되기 때문에 그 결과가 노이즈한 형태로 나타난다. 본 논문에서는 연기의 원본 속도와 제안하는 기법을 통해 생성된 속도 간의 각도 변화를 통해 난류를 생성하며 이를 통해 안정적이고 연기의 밀도를 이류시킨다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.7
• /
• pp.349-358
• /
• 2005

False sharing is a result of co-location of unrelated data in the same unit of memory coherency, and is one source of unnecessary overhead being of no help to keep the memory coherency in multiprocessor systems. Moreover. the damage caused by false sharing becomes large in proportion to the granularity of memory coherency. To reduce false sharing in a page-based DSM system, it is necessary to allocate unrelated data objects that have different access patterns into the separate shared pages. In this paper we propose call-site tracing-based shared memory allocator. shortly CSTallocator. CSTallocator expects that the data objects requested from the different call-sites may have different access patterns in the future. So CSTailocator places each data object requested from the different call-sites into the separate shared pages, and consequently data objects that have the same call-site are likely to get together into the same shared pages. We use execution-driven simulation of real parallel applications to evaluate the effectiveness of our CSTallocator. Our observations show that by using CSTallocator a considerable amount of false sharing misses can be additionally reduced in comparison with the existing techniques.

• Journal of Ocean Engineering and Technology
• /
• v.23 no.1
• /
• pp.38-42
• /
• 2009

Recently, various particle based simulation techniques, which solve the Navier Stokes and continuity equations, have been developed and applied to complicated engineering problems. However, although progress is being made on their visualization or rendering techniques, these are still insufficient. In this study, to render a smooth configuration for a free surface, a rendering technique was developed that included the generation of density fields from the location information for simulated particles and the creation model for a polygonal surface. The developed rendering technique was applied to the visualization of a dynamic free surface flow interacting with a structure using a particle based simulation technique.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.5
• /
• pp.90-96
• /
• 2017

Due to the merit of having wide range with low cost, HF radar's ship detection and tracking research as maritime surveillance system has been recently studied. Many ship detection and tracking algorithms have been developed so far, however, performance comparison cannot be conducted properly because the states of target ships (such as moving path, size, etc.) differ from each study. In this paper, we propose a simulator based on compact HF radar, which generates data according to the size and moving path of target ship. Given the generated data with identical ship state, it is possible to conduct performance comparison. In order to validate the proposed simulator, the simulated data has been compared with real data collected by the SeaSonde HF radar sites. As a result, it has been shown that our simulated data resembles the real data. Therefore, the performance of various detection or tracking algorithms can be compared and analyzed respectively by using our simulated data.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.2
• /
• pp.225-231
• /
• 2012

In this paper, we propose a method for designing the path tracking controller using an approach angle concept for an underactuated autonomous underwater vehicle (AUV). The AUV is controlled by the surge speed and yaw rate: there is no side thruster. To solve this underactuated AUV problem in the path tracking, we introduce an approach angle concept which makes the AUV converge to the reference path. And we design the path tracking controller using the proposed approach angle. To design the path tracking controller, we obtain the new vehicle's error dynamics in the body-fixed frame, and then design the path tracking controller based on Lypunov direct method. Finally, some simulation results demonstrate the effectiveness of the proposed controller.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5C
• /
• pp.556-564
• /
• 2007

This paper proposes an efficient scheme to track a time variant channel induced by multi-path Rayleigh fading in mobile MIMO-OFDM systems with null sub-carriers. The proposed adaptive channel tracking scheme removes in the frequency domain the interfering signals of the other transmit (Tx) antennas by using a predicted channel frequency response before starting the channel estimation. Time domain channel estimation is then performed to reduce the additive white Gaussian noise (AWGN). The simulation results show that the proposed method is better than the conventional channel tracking method [3] in time varying channel environments. At a Doppler frequency of 300 Hz and bit error rates (BER) of 10-3, signal-to-noise power ratio (Eb/N0) gains of about 2.5 dB are achieved relative to the conventional channel tracking method [3]. At a Doppler frequency of 600 Hz, the performance difference between the proposed method and conventional one becomes much larger.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.2
• /
• pp.186-190
• /
• 2015

Intelligent vehicle plans motion and navigate itself based on the surrounding environment perception. Hence, the precise environment recognition is an essential part of self-driving vehicle. There exist many vulnerable road users (e.g. vehicle, pedestrians) on vehicular driving environment, the vehicle must percept all the dynamic obstacles accurately for safety. In this paper, we propose an multiple vehicle tracking algorithm using microwave radar. Our proposed system includes various special features. First, exceptional radar measurement model for vehicle, concentrated on the corner, is described by mixture density network (MDN), and applied to particle filter weighting. Also, to conquer the curse of dimensionality of particle filter and estimate the time-varying number of multi-target states, reversible jump markov chain monte carlo (RJMCMC) is used to sampling step of the proposed algorithm. The robustness of the proposed algorithm is demonstrated through several computer simulations.