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

• 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 Korean Society of Disaster and Security
• /
• v.8 no.2
• /
• pp.27-31
• /
• 2015

The purpose of this study is to improve the capacity of public officials that can respond quickly and effectively in the event of food and medical products crisis. In order to improve the emergency response capacity, it must be preceded to identify what kinds of response activities and capacities are needed in case of food and medical product crisis. To this end, this study examined the definition of food and drug related crisis, and investigated and analyzed domestic and international leading researches and data about the capacity related to emergency, crisis or disaster. Based on the result of the analysis, the crisis response capacity was defined as 'the ability to quickly perform response tasks at the time of crisis', and the response tasks were identified by analysing the crisis response manuals of the Ministry of Food and Drug Safety. Since identifying the response tasks clearly can be a basis for training, exercise, and evaluation, it is expected to contribute to enhance the crisis response capabilities directly and effectively.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.1
• /
• pp.1-12
• /
• 1998

In 2D(two-dimensional) mesh system, an efficient submesh allocation scheme must have low time overhead for allocation and low response times for incoming tasks. Quick Allocation(QA) reduces submesh allocation time, but can cause high external fragmentation. Due to this, response times for incoming tasks increase. In this paper, we have improved QA to diminish external fragmentation while having not nearly effect on allocation time. Simulation revealed that modified algorithm reduces to some extent the mean response time of the tasks compared to QA.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.72-75
• /
• 2004

In this paper, the task assignment strategy considering communication delay and the priority of distributed tasks is proposed for the real-time network system in order to maximize the utilization of the system. For the task assignment strategy, the relationship among priority of tasks in network nodes, the calculation time of each task, and the end-to-end response time including the network delay is formulated firstly. Then, the task assignment strategy using the genetic algorithm is proposed to optimize the utilization of the system considering the LCM(Least Common Multiple) period. The effectiveness of proposed strategy is proven by the simulation for estimating the performance such as the utilization and the response time of the system in case of changing the number of tasks and the number of network nodes.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2019.07a
• /
• pp.7-8
• /
• 2019

In this paper, we applied the migration technique to real-time tasks that have relatively low criticality but still important to be dropped by the mixed-criticality scheduling algorithms. The proposed drop and migrate algorithm analyzes the schedulability by calculating CPU utilization and response time of using task migration. We provide analysis to guarantee the deadline of LO-tasks, by transforming the response time equation specified with migration time. The transformed response time equation was able to analyze the migration schedulability. This algorithm can be used with various mixed-criticality schedulers as a supplementary method. We expect this algorithm will be used for scheduling LO-tasks such as communication task that requires safety guarantee especially in platooning and autonomous driving by utilizing the advantages of multiple node connectivities.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.5
• /
• pp.506-517
• /
• 2000

In distributed real-time system, a task activated by the completion of its preceding task can be modeled as a periodic task with activation jitter. An activation jitter of a task is defined asthe difference between the worst case and the best case response time of its preceding task. Becausethe existing approaches assume that the best case response time is much smaller than the actual one,the activation jitter and the worst case response time of lower priority tasks are overestimated. Thispaper proposes a new analysis technique to calculate the best case response time more precisely andto reduce the activation jitter bounds. The proposed technique obtains the best case response time byconsidering the relative phase between tasks. The precise analysis of the activation jitters can reducethe worst case response time of other tasks and increase the schedulability. The simulation resultsshow that the proposed analysis technique improves the accuracy of the best case and the worst caseresponse time up to 40% and 6%, respectively.

• Journal of Korean Institute of Industrial Engineers
• /
• v.19 no.2
• /
• pp.53-64
• /
• 1993

Successful completion of a visual task in a predetermined time is very crucial to many operations such as piloting an aircraft. Although existing ergonomic interface models often provide a function of vision tests, it determines only the visibility at any given location. To complement this problem in existing models, the isoresponse time region considering the factors related to visual tasks is presented. Using a multiple regression model, equal response time regions were obtained within which mean response time is expected to be the same and is asymmetrical in shape. Among the factors considered, expectancy significantly decreased response time, and when cued, the effects of field heterogeneity, target uncertainty, density, size contrast and peripheral position on search time were less significant than those in unexpected cases. Response time and error rate, gender and visual acuity were not significantly correlated, and response time and age was positively correlated. These results are expected to be directly applicable to designing various visual tasks in real-life situations.

• Research in Mathematical Education
• /
• v.16 no.4
• /
• pp.245-263
• /
• 2012

The Korean mathematical curriculum has been changed three times during the resent five years. It led to changes in textbook system. In the 2007 revised mathematics curriculum, workbook was developed focusing on student's self-oriented learning, effective practice in differentiated classroom, and mathematics problem solving considering individual difference. This paper examines the characteristics of the tasks and the way the tasks are organized in the textbooks and the workbook in accordance with the 2007 revised mathematics curriculum; comparing with the function section before and after the amendment. Researchers examine whether the textbook and workbook were accomplished the purpose with "cognitive expectation", "level of cognitive demand", "and "response types". Researchers revised framework of [Son, J. W. & Senk, S. (2010). How reform curricula in the USA and Korea present multiplication and division of fraction. Educ. Stud. Math 74(2), 117-142] to make them suitable for the function section at the seventh grade.

• The Journal of Korea Robotics Society
• /
• v.7 no.4
• /
• pp.292-298
• /
• 2012

It is a real-time system that the system correctness depends not only on the correctness of the logical result of the computation but also on the result delivery time. Real-time Operating System (RTOS) is a software that manages the time of a microprocessor to ensure that the most important code runs first so that it is a good building block to design the real-time system. The real-time performance is achieved by using real-time mechanisms through data communication and synchronization of inter-task communication (ITC) between tasks. Therefore, test on the response time of real-time mechanisms is a good measure to predict the performance of real-time systems. This paper aims to analysis the response characteristics of real-time mechanisms in kernel space for real-time embedded Linux: RTAI and Xenomai. The performance evaluations of real-time mechanism depending on the changes of task periods are conducted. Test metrics are jitter of periodic tasks and response time of real-time mechanisms including semaphore, real-time FIFO, Mailbox and Message queue. The periodicity of tasks is relatively consistent for Xenomai but RTAI reveals smaller jitter as an average result. As for real-time mechanisms, semaphore and message transfer mechanism of Xenomai has a superior response to estimate deterministic real-time task execution. But real-time FIFO in RTAI shows faster response. The results are promising to estimate deterministic real-time task execution in implementing real-time systems using real-time embedded Linux.