• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.2
• /
• pp.351-356
• /
• 2015

Synthetic utilization on multiprocessor system is not considered periodic tasks, except scheduling methods for aperiodic tasks where one of the real-time aperiodic tasks is a scheduling method. But really aperiodic tasks scheduling method is composed of mixed task types. Aperiodic task scheduling method guarantee an analysis of the schedualibility of aperiodic task. The set of mixed tasks periodic and aperiodic tasks scheduling method uses improved synthetic utilization that is presented in this paper. The new method shows that schedulability increases aperiodic server method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.10
• /
• pp.2277-2282
• /
• 2010

O(1) time synthetic utilization is not considered periodic tasks, except scheduling methods for aperiodic tasks where one of the aperiodic tasks is a scheduling method. But really aperiodic tasks scheduling method is composed of mixed task types. Aperiodic task scheduling method guarantee an analysis of the schedualibility of aperiodic task. The set of mixed tasks periodic and aperiodic tasks scheduling method uses synthetic utilization that is presented in this paper. The new method shows that schedulability increases 20% aperiodic server method.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.4
• /
• pp.302-307
• /
• 2012

Real-time systems perform periodic tasks and real-time aperiodic tasks such as alarm processing. Especially the periodic tasks included in control systems such as robots have precedence relationships among them. This paper proposes a new scheduling algorithm based on topological sort and residual time. The precedence relationships among periodic tasks are translated to the priorities of the tasks using topological sort algorithm. During the execution of the system the proposed scheduling algorithm decides on whether or not a newly arrived real-time aperiodic task is accepted based on residual time whenever the aperiodic task such as alarm is arrived. The proposed algorithm is validated using examples.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.1
• /
• pp.9-20
• /
• 2009

In a real-time system with both hard real-time periodic tasks and soft real-time aperiodic tasks, it is important to guarantee the deadlines of each periodic task as well as obtain fast response time for each aperiodic task. This paper proposes Enhanced Total Bandwidth Server (ETBS) with possibly shorter response time than Total Bandwidth Server (TBS), which is efficient and widely used for servicing aperiodic tasks. For uniprocessor system using Earliest Deadline First (EDF) scheduling algorithm, ETBS assigns an on-line deadline to each aperiodic task considering a surplus slack time which gained for every unit execution time of periodic job. The proposed method can fully utilize the processor while meeting all the deadlines of periodic tasks. We show that the proposed ETBS provides better response time of aperiodic tasks than TBS theoretically, but has the same computational complexity as TBS, O(1). Simulation results show that the response time of aperiodic tasks with ETBS are shorter than one with TBS.

• Journal of Digital Contents Society
• /
• v.9 no.4
• /
• pp.561-568
• /
• 2008

Research on the flow shop model has mainly been centered around periodic tasks scheduling. In this paper, we present an algorithm using synthetic utilization that can check the schedulability of aperiodic local tasks and aperiodic end-to-end tasks with precedence relation in the flow shop model. If the scheduling algorithm for aperiodic end-to-end tasks executed in the multiple stage pipeline is applied to the flow shop model, sometimes the actually schedulable tasks are decided to be not schedulable because of the fact that the actually unschedulable tasks are decided to be schedulable. The algorithm presented in this paper solves the problem, and the simulation shows that the schedulability increases 10%.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.5
• /
• pp.866-874
• /
• 2006

This paper proposes a new Dynamic Voltage Scaling(DVS) algorithm to achieve low-power scheduling of aperiodic hard real-time tasks. Aperiodic tasks schedulingcannot be applied to the conventional DVS algorithm and result in consuming energy more than periodic tasks because they have no period, non predictable worst case execution time, and release time. In this paper, we defined Virtual Periodic Task Set(VTS) which has constant period and worst case execution time, and released aperiodic tasks are assigned to this VTS. The period and worst case execution time of the virtual task can be obtained by calculating task utilization rate of both periodic and aperiodic tasks. The proposed DVS algorithm scales the frequency of both periodic and aperiodic tasks in VTS. Simulation results show that the energy consumption of the proposed algorithm is reduced by 11% over the conventional DVS algorithm for only periodic task.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.6 no.2
• /
• pp.55-61
• /
• 2011

We propose power-saving real-time scheduling method for mixed task sets which consist of both time-based periodic and event-based aperiodic tasks in the automotive operating system. In this system, we have to pursue maximization of power-saving using the slack time estimation and minimization of response time of aperiodic tasks simultaneously. However, since these two goals conflict each other, one has to make a compromise between them according to the given application domain. In this paper, we find the adjustment factor which gives better response time of aperiodic tasks with slight power consumption increase. The adjustment factor denotes the gravity of response time for aperiodic tasks. We apply the ccEDF scheduling for time-based periodic tasks and then calculate new utilization to be applied to the adjustment factor. In this paper, we suggest the lccEDF algorithm to make a tradeoff between the two goals by systematically adjusting the factor. Simulation results show that our approach is excellent for variety of task sets.

• Journal of Digital Contents Society
• /
• v.9 no.3
• /
• pp.441-448
• /
• 2008

Recently, several algorithms for scheduling aperiodic tasks have been proposed. Among them, Abdelzaher et al proposed an algorithm to determine the schedulability of aperiodic tasks, and proved that the aperiodic tasks are schedulable if the upperbound of synthetic utilization is less than or equal to $\frac 1{1+\sqrt{1/2}}{\approx}0.59$. But this algorithm has a drawback in that if some tasks, even though they are completed and have no more execution times, are included in the current invocation set, their execution times and deadlines are added to the synthetic utilization. This may lead to a problem in which actually schedulable tasks are decided not to be schedulable. In this paper, we recognize the above mentioned problem and propose an improved synthetic utilization method that can be used to schedule aperiodic tasks more efficiently.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2229-2237
• /
• 2000

This paper intends to improve the problems of the slack stealing algorithm scheduling for periodic tasks with fixed priority and aperiodic tasks which occur dynamically. The Slack stealing algorithm reduces unnecessary waiting time by making the service possible immediately when the slack stealing server gives suitable priority to aperiodic tasks according to the status of aperiodic tasks arrivals at runtime. But no performs the slack stealing, we must calculate execution time of periodic tasks till the point of random. And, execution time of periodic tasks is being repeatedly every hours while the slack algorithm is applied. We show time complexity hen is used as to O(n) if the nubmer of tasks which is applied to the calculation is n. In this appear, due to stored in tables slack times and the execution times of the scheduled periodic tasks, the complexity of aperiodic tasks which is occurring dynamically reduced to O(log n) and improves the responses times. We prove the algorithm proposed in this paper through the simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.8B
• /
• pp.509-520
• /
• 2007

In this paper, we propose a real-time sensor node platform that guarantees the real-time scheduling of periodic and aperiodic tasks through a multitask-based software decomposition technique. Since existing sensor networking operation systems available in literature are not capable of supporting the real-time scheduling of periodic and aperiodic tasks, the preemption of aperiodic task with high priority can block periodic tasks, and so periodic tasks are likely to miss their deadlines. This paper presents a comprehensive evaluation of how to structure periodic or aperiodic task decomposition in real-time sensor-networking platforms as regard to guaranteeing the deadlines of all the periodic tasks and aiming to providing aperiodic tasks with average good response time. A case study based on real system experiments is conducted to illustrate the application and efficiency of the multitask-based dynamic component execution environment in the sensor node equipped with a low-power 8-bit microcontroller, an IEEE802.15.4 compliant 2.4GHz RF transceiver, and several sensors. It shows that our periodic and aperiodic task decomposition technique yields efficient performance in terms of three significant, objective goals: deadline miss ratio of periodic tasks, average response time of aperiodic tasks, and processor utilization of periodic and aperiodic tasks.