• Journal of the Korea Computer Industry Society
• /
• v.2 no.7
• /
• pp.923-932
• /
• 2001

In this paper, An imprecise real-time task sets composed of multimedia datas are generated using several parameters and an algorithm which can analyse schedulability of generated imprecise real-time task sets before execution of this task sets is proposed. Also, The schedulability of task set depends on variation of parameter values which were used during the generation of the task set is studied. As a result of experiment, It isproved that the schedulability of task set is more and more weak as large as execution requirement time of mandatory subtasks and, as many as the number of tasks which can be scheduled at some instant. The schedulabilty analysis algorithm which is presented on this paper is expected to use effectively on QoS service of multimedia datas.

• Journal of Computing Science and Engineering
• /
• v.7 no.2
• /
• pp.89-98
• /
• 2013

This paper presents a complete survey of recent techniques that are applied in the field of real-time Java computing. It focuses on the issues that are especially important for hard real-time applications, which include time predictable garbage collection, worst-case execution time analysis of Java programs, real-time Java threads scheduling and compiler techniques designed for real-time purpose. It also evaluates experimental frameworks that can be used for researching real-time Java. This overview is expected to help researchers understand the state-of-the-art and advance the research in real-time Java computing.

• ETRI Journal
• /
• v.36 no.1
• /
• pp.99-105
• /
• 2014

This paper presents a new locomotion mode recognition method based on a transformed correlation feature analysis using an electromyography (EMG) pattern. Each movement is recognized using six weighted subcorrelation filters, which are applied to the correlation feature analysis through the use of six time-domain features. The proposed method has a high recognition rate because it reflects the importance of the different features according to the movements and thereby enables one to recognize real-time EMG patterns, owing to the rapid execution of the correlation feature analysis. The experiment results show that the discriminating power of the proposed method is 85.89% (${\pm}2.5$) when walking on a level surface, 96.47% (${\pm}0.9$) when going up stairs, and 96.37% (${\pm}1.3$) when going down stairs for given normal movement data. This makes its accuracy and stability better than that found for the principal component analysis and linear discriminant analysis methods.

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

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.4
• /
• pp.376-380
• /
• 2008

This paper deals with a performance analysis of real-time control systems, which engages DMR(dual modular redundancy) to detect transient errors and checkpointing technique to tolerate transient errors. Transient errors are caused by transient faults and the most significant type of errors in reliable computer systems. Transient faults are assumed to occur according to a Poisson process and to be detected by a dual modular redundant structure. In addition, an equidistant checkpointing strategy is considered. The probability of the successful task completion in a real-time control system where periodic checkpointing operations are performed during the execution of a real-time control task is derived. Numerical examples show how checkpoiniting scheme influences the probability of task completion. In addition, the result of the analysis is compared with the simulation result.

• Korean Journal of Construction Engineering and Management
• /
• v.6 no.3 s.25
• /
• pp.156-166
• /
• 2005

The purpose of this study is to present proper VE application methods to euly design phases. Since VE methodology is more effective on early stage of design phase, the study focused on application of VE methodology in early stage of design process. With the examination of past studies, obstacles of VE application in domestic construction industry are defined. To solve these problems, this paper presents (1) subdivision of VE execution time, (2) an appropriate VE targeting method for construction industry, (3) a resonable and practical function analysis process, and (4) modified design-VE job plan.

• Journal of Computing Science and Engineering
• /
• v.5 no.2
• /
• pp.131-140
• /
• 2011

Different cores typically share the last-level cache in a multi-core processor. Threads running on different cores may interfere with each other. Therefore, the multi-core worst-case execution time (WCET) analyzer must be able to safely and accurately estimate the worst-case inter-thread cache interference. This is not supported by current WCET analysis techniques that manly focus on single thread analysis. This paper presents a novel approach to analyze the worst-case cache interference and bounding the WCET for threads running on multi-core processors with shared L2 instruction caches. We propose to use an interference matrix to model inter-thread interference, on which basis we can calculate the worst-case inter-thread cache interference. Our experiments indicate that the proposed approach can give a worst-case bound less than 1%, as in benchmark fib-call, and an average 16.4% overestimate for threads running on a dual-core processor with shared-L2 cache. Our approach dramatically improves the accuracy of WCET overestimatation by on average 20.0% compared to work.

• Journal of KIISE:Software and Applications
• /
• v.37 no.9
• /
• pp.669-675
• /
• 2010

For detecting requirement errors in early system development phase, the behaviors of a system should be described in formal methods and be analyzed with analysis techniques such as reachability analysis and cycle detection. However, since they are usually based on explicit exploration of system state space, state explosion problem may be occurred when a system becomes complex. That is, the memory and execution time for exploration exponentially increase due to a huge state space. In this paper, we analyze the fundamental causes of this problem in concurrent systems and explore the state space without composing concurrent state spaces for reducing the memory requirement for exploration. Also our new technique keeps a visited history minimally for reducing execution time. Finally we represent experimental results which show the efficiency of our technique.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.11
• /
• pp.103-109
• /
• 2018

This paper presents an idea and framework to automate a full cycle business process management and re-engineering by integrating traditional business process management systems, process mining, data mining, machine learning, and simulation. We build our framework on the cloud-based platform such that various data sources can be incorporated. We design our systems to be extensible so that not only beneficial for practitioners of BPM, but also for researchers. Our framework can be used as a test bed for researchers without the complication of system integration. The automation of redesigning phase and selecting a baseline process model for deployment are the two main contributions of this study. In the redesigning phase, we deal with both the analysis of the existing process model and what-if analysis on how to improve the process at the same time, Additionally, improving a business process can be applied in a case by case basis that needs a lot of trial and error and huge data. In selecting the baseline process model, we need to compare many probable routes of business execution and calculate the most efficient one in respect to production cost and execution time. We also discuss the challenges and limitation of the framework, including the systems adoptability, technical difficulties and human factors.

• The Korean Journal of Pain
• /
• v.37 no.1
• /
• pp.59-72
• /
• 2024

Background: This study assessed the postoperative analgesic efficacy and safety of the quadratus lumborum block (QLB) in pediatric patients. Methods: Electronic databases were searched for studies comparing the QLB to conventional analgesic techniques in pediatric patients. The primary outcome was the need for rescue analgesia 12 and 24 hours after surgery. Secondary outcomes covered the Face-Legs-Activity-Cry-Consolability Scale (FLACC) scores at various time points; parental satisfaction; time to the first rescue analgesia; hospitalization time; block execution time; block failure rates, and adverse events. Results: Sixteen randomized controlled trials were analyzed involving 1,061 patients. The QLB significantly reduced the need for rescue analgesia both at 12 and 24 hours after surgery (12 hours, relative risk [RR]: 0.45; 95% confidence interval [CI]: 0.01, 0.88; 24 hours, RR: 0.51; 95% CI: 0.31, 0.70). In case of 24 hours after surgery, type 1 QLB significantly reduced the need for rescue analgesia (RR: 0.56; 95% CI: 0.36, 0.76). The QLB also exhibited lower FLACC scores at 1 hour (standardized mean difference [SMD]: -0.87; 95% CI: -1.56, -0.18) and 6 hours (SMD: -1.27; 95% CI: -2.33, -0.21) following surgery when compared to non-QLB. Among QLBs, type 2 QLB significantly extended the time until the first rescue analgesia (SMD: 1.25; 95% CI: 0.84, 1.67). No significant differences were observed in terms of parental satisfaction, hospitalization time, block execution time, block failure, or adverse events between QLB and non-QLB groups. Conclusions: The QLB provides non-inferior analgesic efficacy and safety to conventional methods in pediatric patients.