• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.4
• /
• pp.12-21
• /
• 1992

Many real-time supporting features are used to execute real-time process in a time-constraints given. In this paper, The real-tiem resources management mechanism based time constraints which order resources supporting real-time processes blocked by the processes was proposed. This mechanism was all implemented and tested on the UNIX operating system.

• 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 IKEEE
• /
• v.5 no.2 s.9
• /
• pp.164-173
• /
• 2001

In this paper, we have designed and implemented a new hard embedded real-time system to satisfy hard real-time constraints in moving independently. Real-time kernel should be small size, fast and predictable. Because of the great variety of demands on real time scheduling, a real time kernel should also include a flexible and re-programmable task scheduling discipline. In this paper, we present that real-time applications should be split into small and simple parts with hard real-time constraints. To satisfy these properties, we designed real-time kernel and general kernel, that have their different properties. In real-time tasks, interrupt processing should be run. In general kernel, non real time tasks or general tasks are run. The efficiency of the proposed hard embedded real-time system is shown by comparison results for performance of the proposal real time kernel with both RT-Linux and QNX.

• International Journal of Control, Automation, and Systems
• /
• v.4 no.5
• /
• pp.601-614
• /
• 2006

In this paper, a study on task assignment strategies for a complex real-time network system is presented. Firstly, two task assignment strategies are proposed to improve previous strategies. The proposed strategies assign tasks with meeting end-to-end real-time constraints, and also with optimizing system utilization through period modulation of the tasks. Consequently, the strategies aim at the optimizationto optimize of system performance with while still meeting real-time constraints. The proposed task assignment strategies are devised using the genetic algorithmswith heuristic real-time constraints in the generation of new populations. The strategies are differentiated by the optimization method of the two objectives-meeting end-to-end real-time constraints and optimizing system utilization: the first one has sequential genetic algorithm routines for the objectives, and the second one has one multiple objective genetic algorithm routine to find a Pareto solution. Secondly, the performances of the proposed strategies and a well-known existing task assignment strategy using the BnB(Branch and Bound) optimization are compared with one other through some simulation tests. Through the comparison of the simulation results, the most adequate task assignment strategies are proposed for some as system requirements-: the optimization of system utilization, the maximization of running tasktasks, and the minimization of the number of network node nodesnumber for a network system.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2797-2808
• /
• 1999

Timing Constraint Petri Nets(TCPN) extend petri nets by adding timing constraints, it is provide a formal method for the modeling and analysis of real-time system. A real-time schedulability analysis decide that a set of concurrent processes will always meet its deadline. In this paper, we present TCPN model for real-time system include timing constraints and propose a schedulability analysis algorithm using them. Also, When the TCPN model is unscheduleable under the imposed timing constraints, we propose a recovery technique that will be scheduleable by the system specification modifying or timing constraints relaxing in the optimized time.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.2
• /
• pp.175-185
• /
• 2005

The scheduling methods of the distributed real-time systems have been proposed. However, they have some weak points. They did not schedule both sporadic and periodic tasks and messages at the same time or did not consider the end-to-end constraints such as precedence relations between sporadic tasks. This means that system scheduling must guarantee the constraints of practical systems and be applicable to them. This paper proposes a new scheduling method that can be applied to more practical model of distributed real-time systems. System model consists of sporadic and periodic tasks with precedence relations and sporadic and periodic messages and has end-to-end constraints. The proposed method is based on a binary search-based period assignment algorithm, an end-to-end laxity-based priority assignment algorithm, and three kinds of schedulability analysis, node, network, and end-to-end schedulability analysis. In addition, this paper describes the application model of sporadic tasks with precedence constraints in a distributed real-time system, shows that existing scheduling methods such as Rate Monotonic scheduling are not proper to be applied to the system having sporadic tasks with precedence constraints, and proposes an end-to-end laxity-based priority assignment algorithm.

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

This paper addresses a supervisory control problem to meet bounded time constraints in real-time nondeterministic discrete event systems (DESs) represented as timed transition models. For a timed language specification representing a bounded time constraint, this paper introduces the notions of trace-controllability and time-controllability. Based on the notions, this paper presents the necessary and sufficient conditions for the existence of a supervisor for a real-time nondeterministic DES to achieve the specification.

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

Researches about scheduling of the distributed real-time systems have been proposed. However, they have some weak points, not scheduling both sporadic and periodic tasks and messages or being unable to guaranteeing the end-to-end constraints due to omitting precedence relations between sporadic tasks. So this paper proposes a new scheduling method for distributed real-time systems consisting of sporadic and periodic tasks with precedence relations and sporadic and periodic messages, guaranteeing end-to-end constraints. The proposed method is based on a binary search-based period assignment algorithm, an end-to-end laxity-based priority assignment algorithm, and three kinds of schedulability analysis, node, network, and end-to-end schedulability analysis. In addition, this paper describes the application model of sporadic tasks with precedence constraints in a distributed real-time system, shows that existing scheduling methods such as Rate Monotonic (RM) scheduling are not proper to be applied to the system having sporadic tasks with precedence constraints, and proposes an end-to-end laxity-based priority assignment algorithm.

• International Journal of Internet, Broadcasting and Communication
• /
• v.15 no.1
• /
• pp.79-84
• /
• 2023

Due to the rapid performance improvement of smartphones, multitasking on mobile platforms has become an essential feature. Unlike traditional desktop or server environments, mobile applications are mostly interactive jobs where response time is important, and some applications are classified as real-time jobs with deadlines. When interactive and real-time jobs run concurrently, memory allocation between multitasking applications is a challenging issue as they have different time requirements. In this paper, we study how to allocate memory space when real-time and interactive jobs are simultaneously executed in a smartphone to meet the multitasking requirements between heterogeneous jobs. Specifically, we analyze the memory size required to satisfy the constraints of real-time jobs and present a new model for allocating memory space between heterogeneous multitasking jobs. Trace-driven simulations show that the proposed model provides reasonable performance for interactive jobs while guaranteeing the requirement of real-time jobs.

• Proceedings of the KIEE Conference
• /
• 2004.05a
• /
• pp.59-61
• /
• 2004

Researches about scheduling distributed real-time systems have some weak points, not scheduling both sporadic and periodic tasks and messages or being unable to guaranteeing the end-to-end constraints due to omitting precedence relations between sporadic tasks. This paper describes the application model of sporadic tasks with precedence constraints in a distributed real-time system. It is shown that existing scheduling methods such as Rate Monotonic scheduling are not proper to be applied to the system having sporadic tasks with precedence constraints. So this paper proposes an end-to-end laxity-based priority assignment algorithm which considers the practical laxity of a task and allocates a proper priority to a task.