• International Journal of Internet, Broadcasting and Communication
• /
• v.10 no.3
• /
• pp.26-34
• /
• 2018

In this paper, we propose a scheduling scheme that can efficiently serve I/O requests having deadlines in flash storage. The I/O requests with deadlines, namely, real-time requests, are assumed to be issued for streaming services of continuous media. Since a Web-based streaming server commonly supports downloads of HTMLs or images, we also aim to quickly process non-real-time I/O requests, together with real-time ones. For this purpose, we adopt the well-known rate-reservation EDF (RR-EDF) algorithm for determining scheduling priorities among mixed I/O requests. In fact, for the use of an EDF-style algorithm, overhead of task's switching should be low and predictable, as with its application of CPU scheduling. In other words, the EDF algorithm is inherently unsuitable for scheduling I/O requests in HDD storage because of highly varying latency times of HDD. Unlike HDD, time for reading a block in flash storage is almost uniform with respect to its physical location. This is because flash storage has no mechanical component, differently from HDD. By capitalizing on this uniform block read time, we compute bandwidth utilization rates of real-time requests from streams. Then, the RR-EDF algorithm is applied for determining how much storage bandwidth can be assigned to non-real-time requests, while meeting deadlines of real-time requests. From this, we can improve the service times of non-real-time requests, which are issued for downloads of static files. Because the proposed scheme can expand flexibly the scheduling periods of streams, it can provide a full usage of slack times, thereby improving the overall throughput of flash storage significantly.

• Journal of Digital Contents Society
• /
• v.19 no.6
• /
• pp.1219-1224
• /
• 2018

Nowaday, smart mobile devices on Internet of Things are required to process and deliver greate amount of data in real-time. Therefore, heterogeneous mult-core architecture such the big.LITTLE core architecture, which shows high energy conservation while guaranteeing high performance, are widely employed on up to date smart mobile devices. The LITTLE cores should be highly utilized to gain higher energy conservation because LITTLE cores have much higher energy efficiency than big cores. In this paper, we propose a core selection algorithm, which tries to firstly assign a real-time task on a LITTLE core rather a big core while the task can be finished within its own deadline. We also perform simulation as performance evaluation to show that our proposed algorithm shows higher energy conservation while guaranteeing the required performance.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.6
• /
• pp.1678-1685
• /
• 1999

In most of the existing real-time schedulers producing the total value as large as possible, the service times for all schedulable tasks are computed at each time a new task arrives. If all scheduled tasks would be executed completely before a new task arrives, the schedule may produce the greatest total value. But this is not always true in real situations. In many cases, (a) new tasks arrive(s) before all the scheduled tasks are executed completely. In this paper, we propose a unique scheduling algorithm for real-time tasks. The proposed algorithm determines the service times only for some tasks with earlier deadlines while the existing algorithms determine the service times for all tasks. This partial computation decreases the average scheduling complexity ramatically, even though, in the worst case, the complexity of the proposed algorithm becomes O(N2), which is equal to that of a previous algorithm that has been known as a less complicated one.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.4
• /
• pp.26-36
• /
• 2000

This paper proposes a neural network algorithm for real-time multiprocessor scheduling problem. The proposed algorithm is developed base on Hopfield neural network for a benefit of parallel processing, in order to finish a requested task within a deadline time. To compare the performance of the proposed algorithm, we used EDA and LLA algorithm that has studied real-time multiprocessor scheduling before. The proposed algorithm is implemented hardware using VHDL.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.5
• /
• pp.43-48
• /
• 2022

With the recent performance improvement of mobile devices as well as the emergence of various applications, not only interactive tasks but also real-time tasks are rapidly increasing. As real-time tasks have deadline requirements, resource management policies used in the conventional time-sharing systems have limitations in satisfying real-time constraints. In this paper, we examine how to efficiently manage resources while satisfying the constraints of real-time tasks through end-to-end resource management of CPU, memory, and storage when interactive and real-time tasks are executed concurrently on a mobile device. Instead of suggesting complicated resource management policies, we focus on examining the basic concepts necessary for each resource management. Specifically, we first look at basic policies such as assigning dedicated CPU cores for real-time tasks, allocating a certain working set of real-time tasks in memory, and using fast storage without context switch in I/O. We then consider how these basic policies can be adopted efficiently.

• The Journal of the Korea Contents Association
• /
• v.15 no.1
• /
• pp.31-43
• /
• 2015

For battery based real-time embedded systems, high performance to meet their real-time constraints and energy efficiency to extend battery life are both essential. Real-Time Dynamic Voltage Scaling (RT-DVS) has been a key technique to satisfy both requirements. In this paper, we present an efficient RT-DVS algorithm called EccEDF that is designed based on ccEDF. The proposed algorithm can precisely calculate the maximum unused utilization with consideration of the elapsed time while keeping the structural simplicity of ccEDF, which overlooked the time needed to run the task in calculating the available slack. The maximum unused utilization can be calculated by dividing remaining execution time($C_i-cc_i$) by remaining time($P_i-E_i$) on completion of the task and it is proved using Fluid scheduling model. We also show that the algorithm outperforms ccEDF in practical applications which is modelled using a PXA250 and a 0.28V-to-1.2V wide-operating-range IA-32 processor model.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.11
• /
• pp.1074-1081
• /
• 2007

This paper presents a method for real-time face detection and tracking which combined Adaboost and Camshift algorithm. Adaboost algorithm is a method which selects an important feature called weak classifier among many possible image features by tuning weight of each feature from learning candidates. Even though excellent performance extracting the object, computing time of the algorithm is very high with window size of multi-scale to search image region. So direct application of the method is not easy for real-time tasks such as multi-task OS, robot, and mobile environment. But CAMshift method is an improvement of Mean-shift algorithm for the video streaming environment and track the interesting object at high speed based on hue value of the target region. The detection efficiency of the method is not good for environment of dynamic illumination. We propose a combined method of Adaboost and CAMshift to improve the computing speed with good face detection performance. The method was proved for real image sequences including single and more faces.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.16 no.2
• /
• pp.8-17
• /
• 2008

This paper presents the Matlab/Simulink-based software-in-the-loop simulation(SILS) environment which is the co-simulator for temporal and functional simulations of control systems. The temporal behavior of a control system is strongly dependent on the implemented software and hardware such as the real-time operating system, the target CPU, and the communication protocol. The proposed SILS abstracts the system with tasks, task executions, real-time schedulers, and real-time networks close to the implementation. Methods to realize these components in graphical block representations are investigated with Matlab/Simulink, which is most commonly used tool for designing and simulating control algorithms in control engineering. In order to achieve a seamless development from SILS to rapid control prototyping (RCP), the SILS block-set is designed to support automatic code generation without tool changes and block modifications.

• Journal of Multimedia Information System
• /
• v.8 no.3
• /
• pp.159-166
• /
• 2021

COVID-19 has dramatically changed people's daily life. Wearing masks is considered as a simple but effective way to defend the spread of the epidemic. Hence, a real-time and accurate mask wearing detection system is important. In this paper, a deep learning-based mask wearing detection system is developed to help people defend against the terrible epidemic. The system consists of three important functions, which are image detection, video detection and real-time detection. To keep a high detection rate, a deep learning-based method is adopted to detect masks. Unfortunately, according to the suddenness of the epidemic, the mask wearing dataset is scarce, so a mask wearing dataset is collected in this paper. Besides, to reduce the computational cost and runtime, a simple online and real-time tracking method is adopted to achieve video detection and monitoring. Furthermore, a function is implemented to call the camera to real-time achieve mask wearing detection. The sufficient results have shown that the developed system can perform well in the mask wearing detection task. The precision, recall, mAP and F1 can achieve 86.6%, 96.7%, 96.2% and 91.4%, respectively.

• The Journal of the Korea Contents Association
• /
• v.7 no.1
• /
• pp.73-82
• /
• 2007

In recent years, embedded systems have been expanding their application domains from traditional applications (such as defense, robots, and artificial satellites) to portable devices which execute more complicated applications such as cellular phones, digital camcoders, PMPs, and MP3 players. So as to manage restricted hardware resources efficiently and to guarantee both temporal and logical correctness, every embedded system use a real-time operating system (RTOS). Only when the RTOS makes kernel services deterministic in time by specifying how long each service call will take to execute, application programers can write predictable applications. Moreover, so as for an RTOS to be deterministic, its scheduling and context switch overhead should also be predictable. In this paper, we present the complete generalized algorithm to determine the highest priority in the ready list with 22r levels of priorities in a constant time without additional memory overhead.