• Journal of the Korea Society of Computer and Information
• /
• v.12 no.3
• /
• pp.147-153
• /
• 2007

Task scheduling is an essential part of any computer system for allocating tasks to a processor of the system among various competitors. As we know, in real-time system, the failure of scheduling a hard real-time task my lead to disastrous consequence. Besides efficiency, resource and speed, real-time system has to take time constraint in serious consideration. This paper proposes a priority-driven scheduling algorithm for real-time multiprocessor system. which is called L-RE coordinates algorithm. L-RE coordinates is a new way of describing the task scheduling problem. In the algorithm, we take both deadline and laxity into consideration for allocating the priority. The simulation result shows that the new algorithm is viable and performance better than EDF and LLF algorithm on schedulability and context switch respectively.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2017.05a
• /
• pp.15-15
• /
• 2017

하천의 수위와 유량 등의 수리량 자료는 치수, 이수, 환경 등에 관한 하천 계획과 관리의 기초자료로 활용된다. 따라서 체계적인 하천 관리를 위해서는 신뢰성 있는 하천 수리량 자료의 확보가 요구된다. 이에 따라 우리나라에서는 많은 하천에 수위 관측소를 설치하여 실시간 수위를 측정하고 있다. 하지만 유량의 측정은 국가하천 등 주요 대규모 하천에 국한되어 있는 실정이다. 반면에 우리나라 대부분의 홍수 피해는 중 소하천에서 발생하고 있지만, 중 소하천에 대한 수문조사는 상대적으로 매우 미진한 실정이다. 이러한 중 소하천에 대한 수리 정보 조사의 가장 큰 어려움은 대부분의 중 소하천이 지방자치단체에서 관리하고 있어 예산과 인력 지원이 어렵기 때문이다. 이에 본 연구에서는 중 소하천에 산재한 보와 같은 하천 횡단 구조물의 유량 측정 기능을 이용하고, 급성장하고 있는 영상 분석 기술과 IT를 하천공학 분야에 접목하여 중 소하천의 수리 정보를 저비용, 실시간으로 원격 측정하는 시스템을 개발하고자 하였다. 이를 위해 연구에서는 저가형 영상 장비를 이용하여 하천 횡단구조물 주변의 흐름 영상을 원격으로 확보하고, 해당 영상을 데이터베이스로 송신하는 장치인 WIA 시스템(wireless image acquisition system)을 개발하였다. 그리고 촬영된 영상을 분석하여 수위를 도출하는 영상 분석 프로그램, 수위-유량 관계 곡선(rating curve), 미계측 지점에 대한 하천 수리 정보를 계산하기 위한 HEC-RAS를 포함하는 River-HQ 시스템을 개발하였다. 개발된 WIA & River-HQ 시스템은 한국건설기술연구원 하천실험센터 내 직선 수로(실규모 하천) 구간에 대하여 정확성이 검증되었다. 이러한 WIA & River-HQ 시스템은 실제 하천에 대한 적용성과 안정성 검토를 통해 향후 중 소하천의 환경 관리와 홍수예경보 업무 등에 활용될 수 있을 것으로 판단된다.

• Journal of KIISE:Information Networking
• /
• v.28 no.3
• /
• pp.347-354
• /
• 2001

This paper proposes and analyzes an error control scheme which tries to recover the transmission error within the deadline of a message on FDDI networks. The error control procedure does not interfere other normal message transmissions by delivering retransmission request via asynchronous traffic as well as by delivering retarnsmitted message via overallocated bandwidth which is inevitably produced by the bandwidth allocation scheme for hard real-time guarantee. The receiver counts the number of tokens which it meets, determines the completion of message transmission, and finally sends error report. The analysis results along with simulation performed via SMPL show that the proposed scheme is able to enhance the deadline meet ratio of messages by overcoming the network errors. Using the proposed error control scheme, the hard real-time network can be built at cost lower than, but performacne comparable to the dual link network.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.9
• /
• pp.1167-1176
• /
• 2002

In a (hard) real-time system, every time-critical task must meet its timing constraint, which is typically specified in terms of its deadline. Many computer systems, such as those for open system environment or multimedia services, need an efficient schedulability test for on-line real-time admission control of new jobs. Although various polynomial time schedulability tests have been proposed, they often fail to decide the schedulability of the system precisely when the system is heavily loaded. Furthermore, the most of previous studies on on-line real-time schedulability tests are concentrated on periodic task applications. Thus, this paper presents an efficient on-line real-time schedulability check algorithm which can be used for imprecise real-time system predictability before dispatching of on-line imprecise real-time task system consisted of aperiodic and preemptive task sets when the system is overloaded.

• Journal of Life Science
• /
• v.29 no.11
• /
• pp.1235-1240
• /
• 2019

The aim of this study was to clarify histologically the effects of fermented fishmeal on the growth rate of fish. For this purpose, olive flounders were fed on fermented fishmeal at the substitution ratios of 0, 25, 50, 75, and 100%, and the effects on the liver and muscle were examined by microscopy. The olive flounder fed on fermented fishmeal at the 25% substitution ratio had the best hepatic condition, as indicated by the highest hepatosomatic index and the lowest fatty liver level, when compared with fish fed the other substitution ratios. The olive flounder fed on fermented fishmeal at the 25% substitution ratio had good motility, based on the presence of wide myocytes. The high growth rate in the olive flounder fed on fermented fishmeal at the 25% substitution ratio therefore seemed to be related to the health status of the liver and muscles. Higher amounts of the fermented fishmeal (75% and 100% substitution ratios) suppressed the growth rate due to adverse effects on hepatic function and motility of the olive flounder.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.6
• /
• pp.1263-1268
• /
• 2018

In this paper, a video analysis is proposed to implement video surveillance system with deep learning object detection and probabilistic data association filter for tracking multiple objects, and suggests its implementation using GPU. The proposed video analysis technique involves object detection and object tracking sequentially. The deep learning network architecture uses ResNet for object detection and applies probabilistic data association filter for multiple objects tracking. The proposed video analysis technique can be used to detect intruders illegally trespassing any restricted area or to count the number of people entering a specified area. As a results of simulations and experiments, 48 channels of videos can be analyzed at a speed of about 27 fps and real-time video analysis is possible through RTSP protocol.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2023.11a
• /
• pp.119-119
• /
• 2023

국가 간의 거래가 꾸준하게 증가함에 따라 수출입 활동도 지속적으로 증가하고 있다. 수출입 활동을 위해서는 포워더의 활동이 필수적이다. 따라서 본 연구에서는 포워더의 서비스를 이용하는 화주의 만족도를 살펴보기 위해 분석을 실시하였다. 컨테이너화물의 화주와 벌크화물의 화주로 구분하여 ‥‥(중략)‥‥.

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

• The Journal of the Korea Contents Association
• /
• v.6 no.9
• /
• pp.28-41
• /
• 2006

Recently, Baruah et.al. proposed an optimal Pfair scheduling algorithm in the hard real-time multiprocessor environments, and several variants of it were presented. All these algorithms assume the fixed unit quantum size, and this assumption has two problems in the mode change environments. If the quantum size is too large, it results in the scheduling failure due to the decreased processor utilization. If it is too small, it increases the frequency of scheduling points, and it incurs the task switching overheads. In this paper, we propose several methods that determine the maximum quantum size dynamically such that the task set can be scheduled in the mode change environments.

• The Journal of the Korea Contents Association
• /
• v.7 no.7
• /
• pp.39-49
• /
• 2007

Since the PF scheduling algorithm[13], which is optimal in the hard real-time multiprocessor environments, several scheduling algorithms have been proposed. All these algorithms assume the fixed unit quantum size, and this assumption has problems in the mode change environments. To settle the problem, we already proposed a method for deciding the optimal quantum size[2]. In this paper, we propose improved methods considering the task set whose utilization e is less than or equal to p/3+1. As far as the numbers of computations used to determine the optimal quantum size are concerned, newly proposed methods are proved to be more efficient than our previous ones.