• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06b
• /
• pp.79-82
• /
• 2011

무인기용 비행제어 소프트웨어는 인터럽트 핸들러에서 비결정적인 수행결과를 조래하는 경합이 발생될 수 있다. 이러한 유형의 경합을 탐지하기 위한 기존 방법은 원시 프로그램의 인터럽트 핸들러를 스레드로 변환하여 정적 경합탐지 도구를 사용하므로 프로그램 수행 시 실제 발생하지 않는 부정확한 경합(false positives)를 보고한다. 본 연구는 부정확한 경합 보고를 줄이기 위해서 원시 프로그램을 POSIX 실시간 스레브 프로그램으로 변환하고 Lockset기반 탐지기법 의해서 탐지된 공유변수를 대상으로 Happens-before 관계 분석기법을 이용하여 경합을 탐지하는 동적 경합탐지 도구를 사용한다. 제시된 방법의 실험을 위해서 Knob Assembly에 탑재되는 비행제어 소프트웨어를 대상으로 정적 경합탐지 도구와 동적 경합탐지 도구의 경합탐지 결과를 비교 분석한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.774-776
• /
• 1999

공유메모리 병렬프로그램에서의 경합은 프로그램 수행에서 원하지 않는 비결정성을 야기할 수 있기 때문에 반드시 탐지되어져야 한다. 기존의 탐지 기법들은 경합을 탐지하기 위해서 공유 자료구조를 사용하므로 심각한 병목현상을 일으킨다. 본 논문에서는 동기화가 있는 프로그램에서 병목현상을 줄임으로써 탐지의 효율성을 높임과 동시에, 최초로 발생한 경합을 탐지하기 위해서 감시대상이 되는 접근사건들의 수를 감소시키는 기법을 제시한다. 이러한 목적을 위해서 사건선택 알고리즘과 실제적인 실험결과를 통해 본 기법의 효율성을 보인다.

• The KIPS Transactions:PartA
• /
• v.17A no.1
• /
• pp.9-18
• /
• 2010

Races that occur in shared-memory parallel programs such as OpenMP programs must be detected for debugging because of causing unintended non-deterministic results. Previous works which verify the existence of these races on-the-fly are limited to the programs without internal non-determinism. But in the programs with internal non-determinism, such works need at least N! execution instances for each critical section to verify the existence of races, where N is the degree of maximum parallelism. This paper presents a preprocessor that statically analyzes the locations of non-deterministic accesses using program slicing and can detect apparent races as well as potential races through single execution using the analyzed information. The suggested tool can deterministically monitor non-deterministic accesses to occur in OpenMP programs so that this tool can verify the existence of races even if it is used any race detection protocol which can apply to programs with critical section. To prove empirically this tool, we have experimented using a set of benchmark programs such as synthetic programs that involve non-deterministic accesses, OpenMP Microbenchmark, NAS Parallel Benchmark, and OpenMP application programs.

• Proceedings of the KSR Conference
• /
• 2005.05a
• /
• pp.1159-1164
• /
• 2005

현재 철도청이 운용중인 열차운행관리 시스템(Railway Traffic Management System, RTMS)은 서울, 대전, 부산, 순천 그리고 영주 등으로 총 5개 지역본부로 분산되어 있어 업무의 중복을 줄이고, 자동화(Automation)된 열차집중제어장치(Central Traffic Control, CTC)를 구축하기 위해 지역본부를 대전으로 통합하는 프로젝트를 진행중이다. 본 논문은 철도청 사령실 통합 신호설비 구축 프로젝트에 의거하여 열차 경합을 검지 또는 예측하고 운영자에게 최소의 시간 내에 최적의 해소 대책을 제시함을 목적으로 하는 열차 경합 검지 시스템을 구현하는 과정에서 작성되었다. 여기에서는 열차 경합 검지에 대한 개요와 검지 가능한 경합 종류에 대해 기술하고, 실제 구현된 알고리즘의 기본적인 내용, 프로세스의 구성도 및 시뮬레이션 결과를 설명하려고 한다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.3
• /
• pp.301-305
• /
• 2008

Races must be detected for debugging OpenMP programs with directives, because they may cause unintended nondeterministic results of programs. Intel Thread Checker, an existing tool that can detects races, can not verify the existence of races and is often time-consuming and tends to require large space. To solve these problems, we developed a tool that verifies the existence of races using user requirements and analyzed model of programs. However, the tool does not have optimal performance in programs which have no synchronization for interthread coordination. This paper presents an optimal tool that applies the optimum labeling and protocol for program models without interthread coordination. For synthetic programs without interthread synchronization, the tool verifies races over 250 times faster than the previous tool on the average, even if the maximum parallelism increases in every case of which the number of total accesses are identical.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.4
• /
• pp.436-440
• /
• 2008

In IEEE 802.15.4 beacon-enabled mode, performance decreases as the number of devices competing in the contention access period(CAP) increases. In this letter, we propose partitioned contention access mechanism(PCAM) to compensate performance degradation. In PCAM, the PAN coordinator divides CAP into two sub-periods and activity of devices is delimited in their assigned sub-periods. Since PCAM reduces the number of devices which compete at the same time by half, collision probability between transmitted frames can be reduced. In addition, devices can save their power consumption because PCAM shorten the duration that devices stay in active state into half. We perform simulations to compare the performance of PCAM with that of the IEEE 802.15.4 standard. From the result, PCAM yields better performance than IEEE 802.15.4 standard.

• KIISE Transactions on Computing Practices
• /
• v.24 no.1
• /
• pp.10-16
• /
• 2018

The task of consolidating server workloads is critical for the efficiency of a datacenter in terms of reducing costs. However, as a greater number of workloads are consolidated in a single server, the performance of workloads might be degraded due to their contention to the limited shared resources. To reduce the performance degradation, scheduling for mitigating the contention of shared resources is necessary. In this paper, we present the Dynamic Voltage Frequency Scaling (DVFS) based memory-contention aware scheduling method for multi-threaded workloads. The proposed method uses two approaches: running memory-intensive threads on the limited cores to avoid concurrent memory accesses, and reducing the frequencies of the cores that run memory-intensive threads. With the proposed algorithm, we increased performance by 43% and reduced power consumption by 38% compared to the Completely Fair Scheduler(CFS), the default scheduler of Linux.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.11a
• /
• pp.522-525
• /
• 2017

본 연구는 국내 각 과일별 재배 면적 및 해당 지역의 날씨 등의 데이터를 이용하여 실 생산량을 예측하고 각 과일별 경합관계를 적용하여 실제 수입 되는 과일의 수입량과의 상관관계를 분석하여 실제 가격을 예측하고자 한다. 본 결과를 통해 다변화 되는 국내 과일 시장에서 농업, 수입업에 대한 방향성 제시를 그 목적으로 둔다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.1
• /
• pp.88-96
• /
• 2012

According to development of technology for media, observers try to watch the realities from images, as follows, 3D imaging has been extremely developed. 3D image gives depth in the image, observers feel in nature. Different image perception from left and right eyes make the 3D image. Anaglyph which is one of the ways to make an image of three dimensions is for obtaining an image of three dimensions by using color filter glasses. Anaglyph has a little amount of calculation and is easy to make, and it has a good point that anaglyph can be used in more wide field because it can create an image of three dimensions to the output of print like printed matter. However, the phenomenon of retinal rivalry can cause a feeling of fatigue because a difference of brightness of the left image and the right image happen. The way to reduce this problem is made by cutting down a difference of brightness. In the result, retinal rivalry can be reduced. We reduced a difference of the brightness of the left and the right image by utilizing the brightness and average of the original image to reduce retinal rivalry and we made better colors of anaglyph by using the way that we keep the hue caused by a change of brightness and supplement saturation about color distortion which is created at that time.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.7
• /
• pp.63-73
• /
• 2004

This paper proposes an efficient centralized sin91e buffer management algorithm to arbitrate access contention mon processors on the multi-processor system for high-speed Packet filtering and proves that the algorithm provides reasonable performance by implementing it and applying it to a real multi-processor system. The multi-processor system for parallel packet filtering is modeled based on a network processor to distribute the packet filtering rules throughout the processors to speed up the filtering. In this paper we changed the number of processors and the processing time of the filtering rules as variables and measured the packet transfer rates to investigate the performance of the proposed algorithm.