• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.1
• /
• pp.22-32
• /
• 2003

Many of multimedia applications in distributed environments generate the packets which have the real-time characteristics for continuous audio/video data and transmit them according to the teal-time task scheduling theories. In this paper, we model the traffic for continuous media in the distributed multimedia applications based on the high-bandwidth networks and introduce the PDMA algorithm which is the hard real-time task scheduling theory for guaranteeing QoS requested by the clients. Furthermore, we propose the admission control to control the new request not to interfere the current services for maintaining the high quality of services of the applications. Since the proposed admission control is sufficient for the PDMA algorithm, the PDMA algorithm is always able to find the feasible schedule for the set of messages which satisfies it. Therefore, if the set of messages including the new request to generate the new traffic. Otherwise, it rejects the new request. In final, we present the simulation results for showing that the scheduling with the proposed admission control is of practical use.

• Journal of KIISE:Software and Applications
• /
• v.31 no.9
• /
• pp.1196-1203
• /
• 2004

Autonomous agents need considerable computational resources to perform rational decision-making. The complexity of decision-making becomes prohibitive when large number of agents are present and when decisions have to be made under time pressure. One of approaches in time-critical domains is to respond to an observed condition with a predefined action. Although such a system may be able to react very quickly to environmental conditions, predefined plans are of less value if a situation changes and re-planning is needed. In this paper we investigate strategies intended to tame the computational burden by using off-line computation in conjunction with on-line reasoning. We use performance profiles computed off-line and the notion of urgency (i.e., the value of time) computed on-line to choose the amount of information to be included during on-line deliberation. This method can adjust to various levels of real-time demands, but incurs some overhead associated with iterative deepening. We test our framework with experiments in a simulated anti-air defense domain. The experiments show that the off-line performance profiles and the on-line computation of urgency are effective in time-critical situations.

• The KIPS Transactions:PartA
• /
• v.13A no.5 s.102
• /
• pp.405-412
• /
• 2006

Real-time operating systems have been used in various computing environments, where a job must be completed in its deadline, with various conditions, such as effective scheduling policies, the minimum of an interrupt delay, and the solutions of priority inversion problems, that should be perfectly satisfied to design and develop optimal real-time operating systems. Up to now, in order to solve priority inversion problems among several those conditions. There have been two representative protocols: basic priority inheritance protocol and priority ceiling emulation protocol. However, these protocols cannot solve complicated priority inversion problems. In this paper, we design a protocol, called recursive priority inheritance (RPI), protocol that effectively solves the complicated priority inversion problems. Our proposed protocol is also implemented in the Linux kernel and is compared with other existing protocols in the aspect of qualitative analysis.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.1A
• /
• pp.57-63
• /
• 2012

In this paper, we propose a real-time view interpolation method using virtual viewpoint disparity estimation and convergence check. For the real-time process, we estimate a disparity map at the virtual viewpoint from stereo images using the belief propagation method. This method needs only one disparity map, compared to the conventional methods that need two disparity maps. In the view synthesis part, we warp pixels from the reference images to the virtual viewpoint image using the disparity map at the virtual viewpoint. For real-time acceleration, we utilize a high speed GPU parallel programming, called CUDA. As a result, we can interpolate virtual viewpoint images in real-time.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.6
• /
• pp.273-283
• /
• 2008

Many embedded real-time systems have adopted processors supported with dynamic voltage scaling(DVS) recently. Power is one of the important metrics for optimization in the design and operation of embedded real-time systems. We can save considerable energy by using slowdown of processor supported with DVS. In this paper, we propose heuristic algorithms to calculate task slowdown factors for an efficient energy consumption in embedded real-time systems with task synchronization. The previous algorithm has a following constraint : given the tasks are ordered in a nondecreasing order of their relative deadline, the task slowdown factors computed are in a nonincreasing order. In this paper, we relax the constraint and propose heuristic algorithms which have the same time complexity that previous algorithm has and can save more energy. Experimental results show that the proposed algorithms are energy efficient.

• Journal of the Korea Convergence Society
• /
• v.12 no.2
• /
• pp.15-20
• /
• 2021

The imprecise real-time scheduling can be used for minimizing the bad effects of timing faults by leaving less important tasks unfinished if necessary when a transient overload occured. In the imprecise scheduling, every time-critical task can be logically decomposed into two tasks : a mandatory task and an optional task. Recently, some studies in this field showed good schedulability performance and minimum total error by deferring the optional tasks. But the schedulability performance of the studies can be shown only when the execution time of each optional task was less than or equal to the execution time of its corresponding mandatory task. Therefore, in this paper, a new deferring strategy is proposed under the reverse execution time restriction to the previous studies. Nevertheless, the strategy produces comparable or superior schedulability performance to the previous studies and can minimize the total error also.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.174-177
• /
• 2008

In 3D gaming environment, it is important to simulate the physically plausible behaviors of gaming objects in real time. In particular, rigid body dynamics consists in the heart of most game physics. In this paper, we present a constraint-based rigid body simulation method using continuous collision detection as a collision detection method, and LCP formulation as a collision response method. The continuous collision detection method never misses any collisions and thus is able to accurately report the first time of collision as well as its associated colliding features. Moreover, since the number of colliding features is typically low, it also reduces the complexity in the LCP formulation.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.3
• /
• pp.43-49
• /
• 2012

Personalized message syndication is an important process for maximizing the effect of mobile marketing. This paper proposes an algorithm for determining clients satisfying target conditions in real-time. The proxy server as an intermediate node stores client profiles (gender, age, location, etc) and their respective summaries into a database. When a company syndicates messages at run time, the proxy server maps target conditions expressed by boolean expressions to integer value and determines target clients by comparing target value with profile summary. Thus, this approach provides efficient personalized message syndication in very large systems with millions of clients because it can determine target clients in real-time and work with a traditional database easily.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2019.05a
• /
• pp.62-62
• /
• 2019

본 연구에서는 기상청에서 제공하는 인공위성 관측자료와 레이더 자료를 합성하여 예측된 선행시간 2시간의 강수량 예측자료를 이용하여 도시유역의 침수 발생 여부를 확인할 수 있는 시스템을 개발하였다. 대상유역은 부산광역시에 위치하고 있는 유역면적 $54km^2$의 온천천유역으로, $10m{\times}10m$의 해상도로 지표면의 침수예측을 수행한다. 침수예측에 이용되는 모델은 지표면과 하수관망 사이의 상호작용을 효과적으로 고려할 수 있도록 지표면 2차원, 하수관망 1차원 모델을 연계하였으며, 침수예측에 소요되는 시간을 최소화하기 위하여 OpenMP기반의 병렬해석 기법을 적용하였다. 또한 초기조건에 의한 오차를 줄이기 위하여 하천수위 관측소에 관측된 수위자료를 예측모델의 초기조건으로 입력할 수 있도록 시스템을 구성하였으며 유역 하류단에서 경계조건으로 활용되는 예측수위자료는 시계열자료의 예측에 뛰어난 성능을 보여주는 것으로 알려진 LongShort-term Memory(LSTM) 기법을 적용하여 이용하였다. 본 연구에서 개발된 실시간 도시침수 예측 시스템은 집중호우 발생시 침수 발생 위치를 사전에 빠르게 예측하여 도시유역의 인적 물적 자원의 피해를 저감하는데 적극적으로 활용될 수 있을 것으로 기대된다.

• CORROSION AND PROTECTION
• /
• v.12 no.1
• /
• pp.24-29
• /
• 2013

원자력 발전소의 설계 수명이 늘어나고 기존의 가동 원전 또한 장기 운전을 목표로함에 따라, 원자로 압력용기, 가압기, 증기발생기, 배관 등의 주요 구조재료의 장기 열화에 따른 재료 건전성을 유지하는 것이 매우 중요하다. 특히, 응력부식균열 현상은 장기 열화에 의해 일어날수 있는 구조재료에서의 심각한 취화 문제들중의 하나로써, 이 현상을 예방하거나 지연시키기 위해서는 현상의 근본원인과 작동기구를 규명하는 것은 원전의 안전성 유지를 위해 매우 중요하다. 이를 위해서 구조재료 표면의 원전 운전 조건에서의 산화막 특성과 그 형성 거동을 분석하는 것은 매우 중요하게 되는데, 원전 운전 조건은 고온고압의 수화학 환경으로 일반 환경에서 사용가능한 다양한 분석 방법들을 적용하기에 많은 제약을 받게 된다. 그러나, 라만 분광법은 가동 원전의 운전 조건인 고온/고압수 환경 하에서도 실시간으로 산화막 분석이 가능한 기법으로, 본 논문에서는 지금까지의 라만 분광법을 이용하여 고온고압수 환경에서의 주요 구조용 금속 및 합금 표면에 생성된 산화막에 대한 분석 연구 결과에 대하여 소개하고, 앞으로 이를 이용한 구조재료의 열화 현상을 분석 및 열화기구 규명을 위한 연구개발 방향을 제시하고자 한다.