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

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1048-1051
• /
• 1996

In this paper, we present real-time S/W architecture and techniques such as real-time scheduling, synchronization, and etc. for implementation of a real-time control system for driving multi-motors. Simulation shows feasibility of real-time S/W techniques presented here.

• Journal of Multimedia Information System
• /
• v.1 no.2
• /
• pp.95-100
• /
• 2014

Variable message signs (VMS) have the different sizes and a specific type according to the city scene and it has to be displayed by different message on the display panel in real-time. And VMS manufacturers must produce the different products in order to give a customized product to each order. In addition that, they should test and check the correct operation to each VMS product using the different message frame. That is very time and workers consuming and VMS emulator with an automatic variable message generator system is necessary. Also, the automatic message generator system is needed to real-time scheduling in order to display the message on the VMS panel like real world. In this paper, we design and implement the VMS emulator embedded the automatic message frame generator system with real-time scheduling which can set several parameters easily on the windows dialog.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.51 no.7
• /
• pp.294-301
• /
• 2002

A new dynamic scheduling algorithm is proposed for CAN-based real-time system in this paper. The proposed algorithm is extended from an existing EDS(Earliest Deadline Scheduling) approach having a solution to the priority inversion. Using the proposed algorithm, the available bandwidth of network media can be checked dynamically, and consequently arbitration delay causing the miss of deadline can be avoided. Also, non-real time messages can be processed with their bandwidth allocation. Full network utilization and real-time transmission feasibility can be achieved through the algorithm. To evaluate the performance of algorithm, two simulation tests are performed. The first one is transmission data measurement per minute for periodic messages and the second one is feasibility in the system with both periodic messages and non-real time message.

• International Journal of Computer Science & Network Security
• /
• v.21 no.4
• /
• pp.19-27
• /
• 2021

Tasks scheduling have been gaining attention in both industry and research. The scheduling that ensures independent task execution is critical in real-time systems. While task scheduling has gained a lot of attention in recent years, there have been few works that have been implemented into real-time architecture. The efficiency of the classical scheduling strategy in real-time systems, in particular, is still understudied. To reduce total waiting time, we apply three scheduling approaches in this paper: First In/First Out (FIFO), Shortest Execution Time (SET), and Shortest-Longest Execution Time (SLET). Experimental results have demonstrated the efficacy of the SLET in comparison with the others in most cases in a wide range of configurations.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.3
• /
• pp.184-191
• /
• 2010

In the environment of 450mm wafers production known as the next-generation semiconductor production process, one of the most significant features is the full automation over the whole manufacturing processes involved. The full automation system for 450mm wafer production will minimize the human workers' involvement in the manufacturing process as much as possible. In addition, since the importance of an individual wafer processing increases noticeably, it is necessary to develop more robust scheduling systems in the whole manufacturing process than so ever. The scheduling systems for the next-generation semiconductor production processes also should be capable of monitoring individual wafers and collecting useful data on them in real time. Based on the information gathered from these processes, the system should finally have a real-time scheduling functions controlling whole the semiconductor manufacturing processes. In this study, preliminary investigations on the requirements and needed functions for constructing the real time scheduling system and transforming manufacturing environments for 300mm wafers to those of 400mm are conducted and through which the next generation semiconductor processes for efficient scheduling in a clustered production system architecture of the scheduler is proposed. Our scheduling architecture is composed of the modules for real-time scheduling, the clustered production type supporting, the optimal scheduling and so on. The specifications of modules to define the major required functions, capabilities, and the relationship between them are presented.

• ETRI Journal
• /
• v.29 no.3
• /
• pp.270-280
• /
• 2007

In Linux, real-time tasks are supported by separating real-time task priorities from non-real-time task priorities. However, this separation of priority ranges may not be effective when real-time tasks make the system calls that are taken care of by the kernel threads. Thus, Linux is considered a soft real-time system. Moreover, kernel threads are configured to have static priorities for throughputs. The static assignment of priorities to kernel threads causes trouble for real-time tasks when real-time tasks require kernel threads to be invoked to handle the system calls because kernel threads do not discriminate between real-time and non-real-time tasks. We present a dynamic kernel thread scheduling mechanism with weighted average priority inheritance protocol (PIP), a variation of the PIP. The scheduling algorithm assigns proper priorities to kernel threads at runtime by monitoring the activities of user-level real-time tasks. Experimental results show that the algorithms can greatly improve the unexpected execution latency of real-time tasks.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.17 no.32
• /
• pp.63-71
• /
• 1994

The purpose of this paper is to describe an effective cell scheduling system for flexible manufacturing cells. Based on the FMC characteristics, cell scheduling can be defined as a dynamic modified flow shop working in a real-time system. This paper attempt to find the optimal cell scheduling when minimizing the mean flow time for n-job/m-machine problems in static and dynamic environments. Real-time scheduling in an FMC environment requires rapid computation of the schedule.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.5 no.2
• /
• pp.103-110
• /
• 2010

Due to the increasing amount of electronic control system in a vehicle, the automotive software is increasingly sophisticated and complicated. Therefore it may be faced a time critical problem caused by its complexity. In order to solve such problems, the automotive electronic system can use a real-time scheduling mechanism based on predictability. We first consider the standard specification of the AUTOSAR OS and uC/OS-II such as its scheduling theory with time determinism. In this paper, we propose the scheduling algorithm to be conformable to a conformance class of OSEK/VDX specification. Algorithm analysis shows that our scheduling algorithm outperforms an existing Trampoline OS by intuition.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.487-487
• /
• 2000

The scheduling of real-time tasks needs both correctness and timeliness. But it is not easy to schedule real-time tasks having different characteristics in a single system. In this paper we solve the problem through an approach using the performance evaluation of real-time tasks through fuzzy-random variables. Using the performance evaluation through fuzzy-random variable, we can achieve flexible and efficient scheduling for real-time systems.