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

The purpose of this paper is to minimize the a slack computation time of the scheduling of a soft aperiodic real-time tasks in a fixed priority real-time system. The proposed algorithm reduces the computation overhead at on-line time and supports the maximum slack time assigned for aperiodic real-time tasks. The proposed algorithm has 10~20% more response time for aperiodic real-time tasks than that of Slack Stealing Algorithm that offers optimal response time in fixed priority real-time system. However, the performance of the proposed algorithm is seven times better in a scheduling overhead.

• Journal of the Korean Society for Precision Engineering
• /
• v.18 no.7
• /
• pp.53-64
• /
• 2001

The gain-scheduling control technique is vary useful in the control problem incorporating time varying parameters which can be measured in real time. Based on these facts, in this paper the sway control problem of the pendulum motion of a container hanging on the trolly, which transports containers from a container ship to trucks, is considered. In the container crane control problem, suppressing the residual swing motion of the container at the end of acceleration, deceleration or the case of that the unexpected disturbance input exists is main issue. For this problem, in general, the trolley motion control strategy is introduced and applied. But, in this paper, we introduce and synthesize a new type of swing motion control system. In this control system, a small auxiliary mass is installed on the spreader. And the actuator reacts against the auxiliary mass, applying inertial control forces to the container to reduce the swing motion in the desired manner. In this paper, we assume that an plant parameter is varying and apply the gain-scheduling control technique design the anti-swing motion control system for the controlled plant. In this control system, the controller dynamics are adjusted in real-time according to time-varying plant parameters. And the simulation result shows that the proposed control strategy is shown to be useful to the case of time-varying system and, robust to disturbances like winds and initial sway motion.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.777-787
• /
• 2005

In this paper, we propose an urgency- and efficiency-based wireless packet scheduling (UEPS) algorithm that is able to schedule real-time (RT) and non-real-time (NRT) traffics at the same time while supporting multiple users simultaneously at any given scheduling time instant. The UEPS algorithm is designed to support wireless downlink packet scheduling in an orthogonal frequency division multiple access (OFDMA) system, which is a strong candidate as a wireless access method for the next generation of wireless communications. The UEPS algorithm uses the time-utility function as a scheduling urgency factor and the relative status of the current channel to the average channel status as an efficiency indicator of radio resource usage. The design goal of the UEPS algorithm is to maximize throughput of NRT traffics while satisfying quality-of-service (QoS) requirements of RT traffics. The simulation study shows that the UEPS algorithm is able to give better throughput performance than existing wireless packet scheduling algorithms such as proportional fair (PF) and modified-largest weighted delay first (M-LWDF), while satisfying the QoS requirements of RT traffics such as average delay and packet loss rate under various traffic loads.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.10a
• /
• pp.101-104
• /
• 2002

Leading companies have embraced the new economy with new and innovative BTO models. Instead of conventional company-oriented manufacturing scheduling, customer-oriented scheduling method attracts more and more attention. To evaluate the delivery of customer order in advance, the real production capacity as well as procurement lead time should be taken into account. This paper describes a quasi-real-time order delivery estimation system using TOC(Theory of Constraints) based scheduling method.

• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.7
• /
• pp.567-573
• /
• 2001

A real-time HVAC system is proposed which implements real-time control of thermal environment for virtual reality. It consists of a pair of hot and cold loops that serve as thermal reservoirs, and a mixing box to mix hot and cold air streams flowing if from loops. Their flow rates are controlled in real-time to meet a set temperature and flow rate. A cascade control algorithm along with gain scheduling is applied to the system and test results shows that the closed-loop response approached set values within 3 to 4 seconds.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.2
• /
• pp.1-8
• /
• 2002

By now, Schedulers for RMS and EDF are implemented for real-time Linux Scheduler. These Schedulers are used for do not consider there's characteristics. Missing Schedulability-test cause result that increase deadline miss rate. Also The present real-time Linux causes system halt Because of scheduling for unschedulable tasks . These appearances are very fatal for real-time system. Therefor, In this paper The peaceful schedulability-test use scheduler which is proper characteristics of RMS and EDF scheduling methods. This scheduler keeps deadline and eliminates system halt from scheduling unschedulable tasks. In this paper, we propose the schedulability-test algorithm and scheduler select algorithm for the effective management of tasks sets.

• Journal of Korea Multimedia Society
• /
• v.14 no.11
• /
• pp.1478-1490
• /
• 2011

Recently, multi-core processors have been drawing significant interest from the embedded systems research and industry communities due mainly to their potential for achieving high performance and fault-tolerance at low cost in such products as automobiles and cell phones. To process multimedia data, a scheduling algorithm is required to meet timing constraints of periodic tasks in the system. Though Pfair scheduling algorithm can meet all the timing constraints while achieving 100% utilization on multi-core based system theoretically, however, the algorithm incurs high scheduling overheads including frequent core migrations and system-wide synchronizations. To mitigate the problems, we propose a real-time scheduling algorithm for multi-core based system so that system-wide scheduling is performed only when it is absolutely necessary. Otherwise the proposed algorithm performs scheduling within each core independently. The experimental results by extensive simulations show that the proposed algorithm dramatically reduces the scheduling overheads up to as negligible one when the utilization is under 80%.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2369-2373
• /
• 2001

Usually the static scheduling algorithms such as DMS (Deadline Monotonic Scheduling) or RMS(Rate Monotonic Scheduling) are used for CAN scheduling due to its ease with implementation. However, due to their inherently low utilization of network media, some dynamic scheduling approaches have been studied to enhance the utilization. In case of dynamic scheduling algorithms, two considerations are needed. The one is a priority inversion due to rough deadline encoding into stricted arbitration fields of CAN. The other is an arbitration delay due to the non-preemptive feature of CAN. In this paper, an extended algorithm is proposed from an existing EDS(Earliest Deadline Scheduling) approach of CAN scheduling algorithm haying a solution to the priority inversion. In the proposed algorithm, the available bandwidth of network media can be checked dynamically by all nodes. Through the algorithm, arbitration delay causing the miss of their deadline can be avoided in advance. Also non real-time messages can be processed with their bandwidth allocation. The proposed algorithm can achieve full network utilization and enhance aperiodic responsiveness, still guaranteeing the transmission of periodic messages.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.17-21
• /
• 1989

6-DOE simulator system is designed to real-time processing for motion control, data acquisition, image generation and image processing etc.. In this paper, we introduce hardware and software design technologies for distributed processing, event-trapping, system monitoring and time scheduling procedure in 6-DOF simulator system design.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.6
• /
• pp.237-244
• /
• 2013

We propose Energy-constrained Multiprocessor Real-Time Scheduling algorithms for (m,k)-firm deadline constrained tasks (EMRTS-MK). Rather than simply saving as much energy as possible, we consider energy as hard constraint under which the system remains functional and delivers an acceptable performance at least during the prescribed mission time. We evaluate EMRTS-MKs in several experiments, which quantitatively show that they achieve the scheduling objectives.