• Journal of information and communication convergence engineering
• /
• v.14 no.2
• /
• pp.84-88
• /
• 2016

As good example of potential application-specific requirement, (m,k)-firm real-time streams have been recently introduced to deliver multimedia data efficiently in wireless sensor networks. In addition to stream model, communication protocols to meet specific (m,k)-firm real-time streams have been newly developed or extended from existing protocols. However, since the existing schemes for an (m,k)-firm stream have been proposed under typical flat architecture, the scalability problem remains unsolved when the number of real-time flows increases in the networks. To solve this problem, in this paper, we propose a new clustering scheme for an (m,k)-firm stream. The two different clustering algorithms are performed according to either the (m,k)-firm requirement or the deadline. Simulation results are presented to demonstrate the suitability of the proposed scheme under hierarchical architecture by showing that its performance is acceptable irrespective of the increase in the number of flows.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.338-341
• /
• 2005

In this paper, a real-time communication method using a PICNET-NP(Plant Instrumentation and Control Network for Nuclear Power Plant) is proposed with an analysis of the control network requirements of DCS (Distributed Control System) in nuclear power plants. The method satisfies deadline in case of worst data traffics by considering aperiodic and periodic real-time data and others. In addition, the method was used to analyze the data characteristics of the DCS in existing nuclear power plant. The result shows that use of this method meets the response time requirement(100ms).

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.2
• /
• pp.356-363
• /
• 2002

Transactions in real-time active databases have the notion of activeness where transactions are generated by external effects and another transaction. In this paper, we improve the real -time active concurrency control algorithm by applying Thomas' write rule and considering relationship between transactions fired by active rules. We also present the experimental results of our algorithm comparing other real-time active concurrency control algorithms. The experimental results show that our algorithm has superior performance with respect to the raio of transactions satisfying deadline.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.4
• /
• pp.26-36
• /
• 2000

This paper proposes a neural network algorithm for real-time multiprocessor scheduling problem. The proposed algorithm is developed base on Hopfield neural network for a benefit of parallel processing, in order to finish a requested task within a deadline time. To compare the performance of the proposed algorithm, we used EDA and LLA algorithm that has studied real-time multiprocessor scheduling before. The proposed algorithm is implemented hardware using VHDL.

• Proceedings of the KSR Conference
• /
• 2000.05a
• /
• pp.324-329
• /
• 2000

Object of a real-time system, that performs exact information based on the real-time constraint. is required for an improvement of high reliability. The fault-tolerant task scheduling strategy of multiprocessor as using a distributed memory based on a hardware redundancy can be improved into a high reliability of the real-time system. Therefore, this paper is shown to analyze the reliability of the system by using the transfer parameter and make the modeling in reference to a minimization of the fault-tolerant task scheduling strategy which uses a percentage of task missing and deadline parameter based on optimization task size.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.8
• /
• pp.1934-1939
• /
• 2013

In this paper, we consider the online scheduling problem of jobs with deadlines. The jobs arrive over time and the scheduling algorithm has no information about the arriving jobs in advance. The jobs have the processing time of the equal length and the goal of the scheduling algorithm is to maximize the number of jobs completed in their deadlines. The performance of the online algorithm is compared with that of the optimal algorithm which has the full information about all the jobs. The raio of the two performances is called the competitive ratio. In general, the ratio is unbouned. So the case that the online algorithm can have more resources than the optimal algorithm is considered, which is called the resource augmentation analysis. In this paper, the online algorithm have more machines. We show that the online algorithm can have the same performance as the optimal algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.12
• /
• pp.2179-2187
• /
• 2008

The P2P technology has been widely used to distribute files efficiently, and its use in streaming is rapidly increasing. P2P streaming has issues about startup-delay, scalability, and real-time playback, however, what affects these factors has not been researched sufficiently. This paper suggests a buffering model for progressive download within mesh-based P2P system, which corresponds to downloading and playing the content at the same time. It is used to analyze PDF(Playback Deadline First), Rarest algorithms which are block-selection strategies of P2P streaming and proposes a mixed selection of them. The mixed block selection strategy dynamically performs different strategies based on whether the blocks to be played are received or not. In consequence, it enhances the QoS of streaming in a single peer point of view, as well as improving block distributions in an overlay network.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.6
• /
• pp.433-440
• /
• 2000

To flexibly evaluate performance and reliability of a real-time system which is intrinsically characterized by stringent timing constraints to generate correct responses, we propose fuzzyrandom variables and build a discrete event model embedded with fuzzy-random variables. Also, we adapt fuzzy-variables to a path-space approach, which derives the upper and lower bounds of reliability by using a semi-Markov model that explicitly contains the deadline information. Consequently, we propose certain formulas of state automata properly transformed by fuzzy-random variables, and present numerical examples applying the formulas to RTP(Rapid Thermal Process) to show that a complex system can be properly evaluated based on this model by computer simulation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.835-837
• /
• 2005

컴퓨터 산업의 빠른 발전과 더불어 근래에는 임베디드 시스템 분야가 빠르게 성장하고 있다. 이전에 작고 단순하던 임베디드 시스템이 산업의 발전과 사용자의 다양한 요구로 운영체제의 필요성이 높아지고 운영체제하에서 관리하는 실시간 프로세스들의 크기와 복잡도가 빠르게 증가하고 있다. 본 논문에서는 분산 실시간 객체 모델인 TMO-MicroC/OS-II의 실시간 스케줄러의 설계와 구현 방법을 기술하였다. TMO-MicroC/OS-II는 $Micrium^{TM}$에서 개발한 임베디드 OS인 MicroC/OS-II에 분산실시간 객체 모델인 TMO를 적용시킨 것이다. TMO (Time-triggered Message-triggered Object)는 시간조건에 의해 구동되는 객체 내의 실시간 스레드들의 동적 맴버들로 구성되는 프로그래밍 페러다임으로 본 논문에서는 TMO모델 적용을 위한 Deadline-driven 스케줄러 구현에 대해서 기술한다.

• Proceedings of the KIEE Conference
• /
• 1999.07b
• /
• pp.1013-1016
• /
• 1999

In this paper, a real-time communication method using a PICNET-NP(Plant Instrumentation and Control Network for Nuclear Power plant) is proposed with an analysis of the control network requirements of DCS (Distributed Control System) in nuclear power plants. The method satisfies deadline in case of worst data traffics by considering aperiodic and periodic real-time data and others. In addition, the method was used to analyze the data characteristics of the DCS in existing nuclear power plant. The result shows that use of this method meets the response time requirement(100ms)