• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.133.3-133
• /
• 2001

This paper analyses the real-time performance of Ethernet based intranet whether it is applicable to the real-time network. Unpredictability of transmission delay by collision-delay-retransmission mechanism in CAMA/CD(Carrier Sense Multiple Access with Collision Detect) of Ethernet is the major reason making hard to apply to real-time system. Both retransmission mechanism of TCP(Transmission Control Protocol) for reliability and sliding windows algorithm for high utilization make hard to predict transmission delay. Because real-time control network require fast responsibility and bustle of short-periodic messages, global-clock for collision avoidance and UDP(User Datagram Protocol) for high utilization of network are used. The mathematical models for time-delay that can be occured between ...

• Journal of Information Technology Services
• /
• v.16 no.3
• /
• pp.103-111
• /
• 2017

The real time scheduling is a key research area in high performance computing and has been a source of challenging problems. A periodic task is an infinite sequence of task instance where each job of a task comes in a regular period. The RMS (Rate Monotonic Scheduling) algorithm has the advantage of a strong theoretical foundation and holds out the promise of reducing the need for exhaustive testing of the scheduling. Many real-time systems built in the past based their scheduling on the Cyclic Executive Model because it produces predictable schedules which facilitate exhaustive testing. In this work we propose hybrid scheduling method which combines features of both of these scheduling algorithms. The original rate monotonic scheduling algorithm didn't consider the uniform sampling tasks in the real time systems. We have enumerated some issues when the RMS is applied to our hybrid scheduling method. We found the scheduling bound for the hard real-time systems which include the uniform sampling tasks. The suggested hybrid scheduling algorithm turns out to have some advantages from the point of view of the real time system designer, and is particularly useful in the context of large critical systems. Our algorithm can be useful for real time system designer who must guarantee the hard real time tasks.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.7
• /
• pp.602-610
• /
• 2000

In communication networks used in safety-critical systems such as control systems in nuclear power plants there exist three types of data traffic : urgent or asynchronous hard real-time data hard real-time periodic data and soft real-time periodic data. it is necessary to allocate a suitable bandwidth to each data traffic in order to meet their real-time constraints. This paper proposes a method to meet the real-time constraints for the three types of data traffic simultaneously under a timer-controlled token bus protocol or the IEEE 802.4 token bus protocol and verifies the validity of the presented method by an example. This paper derives the proper region of the high priority token hold time and the target token rotation time for each station within which the real-time constraints for the three types of data traffic are met, Since the scheduling of the data traffic may reduce the possibility of the abrupt increase of the network load this paper proposes a brief heuristic method to make a scheduling table to satisfy their real-time constraints.

• Journal of Information Processing Systems
• /
• v.5 no.3
• /
• pp.135-144
• /
• 2009

Most of the tasks in wireless sensor networks (WSN) are requested to run in a real-time way. Neither EDF nor FIFO can ensure real-time scheduling in WSN. A real-time scheduling strategy (RTS) is proposed in this paper. All tasks are divided into two layers and endued diverse priorities. RTS utilizes a preemptive way to ensure hard real-time scheduling. The experimental results indicate that RTS has a good performance both in communication throughput and over-load.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.11
• /
• pp.21-27
• /
• 2019

Recently, embedded systems have been introduced in various fields such as smart factories, industrial drones, and medical robots. Since sensor data collection and IoT functions for machine learning and big data processing are essential in embedded systems, it is essential to port the operating system that is suitable for the function requirements. However, in embedded systems, it is necessary to separate the hard real-time system, which must process within a fixed time according to service characteristics, and the flexible real-time system, which is more flexible in processing time. It is difficult to port the operating system to a low-performance embedded device such as 8BIT MCU to perform simultaneous real-time. When porting a real-time OS (RTOS) to a low-specification MCU and performing a number of tasks, the performance of the real-time and general processing greatly deteriorates, causing a problem of re-designing the hardware and software if a hard real-time system is required for an operating system ported to a low-performance MCU such as an 8BIT MCU. Research on the technology that can process real-time processing system requirements on RTOS (ported in low-performance MCU) is needed.

• Journal of Computing Science and Engineering
• /
• v.8 no.1
• /
• pp.25-33
• /
• 2014

In this paper, we quantitatively compare two different time-predictable multicore cache architectures, separate and statically-partitioned caches, through extensive simulation. Current research trends primarily focus on partitioned-cache architectures in order to achieve time predictability for hard real-time multicore based systems, and our experiments reveal that separate caches actually lead to much better performance and energy efficiency when compared to statically-partitioned caches, and both of them are adequate for timing analysis for real-time multicore applications.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.46 no.6
• /
• pp.73-79
• /
• 2009

For the shake of control for movement object, control theory like neural network, nonlinear model predictive control(NMPC) is realized on digital high speed computer. Predictor of flight control system(FCS) based nonlinear model predictive control has to be satisfied with response for hard real-time to perform applications on each module in the FCS. Simultaneously, It gives a serious consideration accuracy to give full play to FCS's performance. Error of mathematical aspect affects realization of whole algorithm. But factors of bring mathematical error is not considered to calculate final accuracy on parameter of predictor. In this paper, Predictor was made using load control model on the digital computer for design FCS at hard real-time and is shown response time on realization algorithm. And is shown realization algorithm of high effective predictor over the accuracy. The predictor was realized on the load control model using Euler method, Heun method, Runge-Kutta and Taylor method.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1655-1658
• /
• 2004

In this paper, we design and implement remote servo motor control system with real-time micro embedded operating system. The system, where controller and camera image grabber are mounted, handles control commands transmitted from a remote PC web browser. A hard real-time servo motor driver running on the real-time micro embedded OS and then a digital control application which confirms precise sampling time intervals is constructed. Frame grabber images transmitted from camera are saved in a image data format to view on remote PC web browser.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.9
• /
• pp.684-690
• /
• 2006

This paper proposes a message transmission model for hard real-time communications of periodic messages on a switched Ethernet and also proposes an algorithm to schedule the messages to be transmitted within their deadlines. The proposed scheduling algorithm is a distributed one and is peformed by the source and the destination nodes without the modification of the operational features of the standard Ethernet switch. When a new periodic message needs to be transmitted, it is first checked whether it can be scheduled on both the transmission and the reception links without affecting the already-scheduled messages, and a feasible schedule is made for the new message if it is schedulable. The proposed scheduling algorithm guarantees the transmission of periodic messages within their deadline and allows flexible message transmission on a hard real-time switched Ethernet through the dynamic addition of new periodic messages during run-time.

• Journal of Computing Science and Engineering
• /
• v.8 no.1
• /
• pp.34-42
• /
• 2014

Time-predictability of computing is critical for hard real-time and safety-critical systems. However, currently there is no metric available to quantitatively evaluate time-predictability, a feature crucial to the design of time-predictable processors. This paper first proposes the concept of architectural time-predictability, which separates the time variation due to hardware architectural/microarchitectural design from that due to software. We then propose the standard deviation of clock cycles per instruction (CPI), a new metric, to measure architectural time-predictability. Our experiments confirm that the standard deviation of CPI is an effective metric to evaluate and compare architectural time-predictability for different processors.