• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.75-78
• /
• 1998

In this paper, we propose a new cell discarding and scheduling scheme which reduce cell loss rate by measuring, in real time, the number of discarded cells in the queuing system with a different loss priority for each class of service such that each class of service meets its cell loss rate requirements and reduce average delay rate for the traffic that is sensitive in cell delay in output buffer of the ATM switch. Throughout the computer simulation, the existing scheduling scheme and proposed scheme are compared with respect to cell loss rate and average delay time.

• 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 Korea Multimedia Society
• /
• v.14 no.1
• /
• pp.76-84
• /
• 2011

Embedded Systems need to ensure real-time of the task response time depending on the applied fields of it. And task could be faulty due to various reasons in real time systems. Therefore in this paper, we design a task scheduler that guarantees deadlines of periodic tasks and considers a fault tolerance of defective task in embedded system with a single processor. In order to provide real-time, we classify tasks with periodic/aperiodic tasks and applies RMS(Rate Monotonic Scheduling) method to schedule periodic tasks and can guarantees execution of aperiodic tasks by managing surplus times obtained after analyzing the execution time of periodic tasks. In order to provide fault tolerance, we manage backup times and reexecute a fault task to restore it's conditions.

• The KIPS Transactions:PartA
• /
• v.8A no.1
• /
• pp.16-26
• /
• 2001

This paper proposes an extended scheduler model that is an extension of the existing model proposed already in [4, 5], which consists of upper layer task scheduler and lower layer scheduling framework. However, in order to support aperiodic task scheduling, the task scheduler has been divided into two parts, such as periodic task control component and aperiodic task control component. Thus, the proposed model can support various bandwidth-preserving servers that can service aperiodic tasks. The model distinctly separates a classic monolithic kernel scheduler into several kernel components according to their functionality. This enables system developers to implement a new scheduling algorithm or aperiodic task server independent of complex low kernel mechanism, and reconfigure the system at need. In Real-Time Linux [6], we implemented the proposed scheduling framework representative scheduling algorithms, and server bandwidth-preserving servers on purpose to test. Throughout these implementations, we confirmed that a new algorithm or server could be developed independently without updates of complex low kernel modules. In order to verify efficiency of the proposed model, we measured the performance of several aperiodic task servers. The results showed this the performance of model, which even consisted of two hierarchical components and several modules, didnt have such high run-time overhead, and could efficiently support reconfiguration and scheduler development.

• Journal of KIISE
• /
• v.43 no.3
• /
• pp.296-303
• /
• 2016

Mobile real-time systems with limited system resources and a limited power source need to fully utilize the system resources when the workload is heavy and reduce energy consumption when the workload is light. EDZL (Earliest Deadline until Zero Laxity), a multiprocessor real-time scheduling algorithm, can provide high system utilization, but little work has been done aimed at reducing its energy consumption. This paper tackles the problem of DVFS (Dynamic Voltage/Frequency Scaling) in EDZL scheduling. It proposes a technique to compute a uniform speed on full-chip DVFS platforms and individual speeds of tasks on per-core DVFS platforms. This technique, which is based on the EDZL schedulability test, is a simple but effective one for determining the speeds of tasks offline. We also show through simulation that the proposed technique is useful in reducing energy consumption.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.11
• /
• pp.611-621
• /
• 2002

For real-time systems, multiprocessor support is indispensable to handle the large number of requests. Existing real-time on-line scheduling algorithms such as Earliest Deadline First Algorithm (EDF) and Least Laxity Algorithm (LLA) may not be suitable for scheduling real-time tasks in multiprocessor systems. Although EDF has low context switching overhead, it suffers from "multiple processor anomalies." LLA has been shown as suboptimal, but has the potential for higher context switching overhead. Earliest Deadline Zero Laxity (EDZL) solved somewhat the problems of those algorithms, however is suboptimal for only two processors. Another algorithm EDA2 shows very good performance in overload phase, however, is not suboptimal for muitiprocessors. We propose two on-line scheduling algorithms, Earliest Deadline/Least Laxity (ED/LL) and ED2/LL. ED/LL is suboptimal for multiprocessors, and has low context switching overhead and low deadline miss rate in normal load phase. However, ED/LL is ineffective when the system is overloaded. To solve this problem, ED2/LL uses ED/LL or EDZL in normal load phase and uses EDA2 in overload phase. Experimental results show that ED2/LL achieves good performance in overload phase as wet] as in normal load phase.oad phase.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.3
• /
• pp.369-381
• /
• 1999

Recently, the researches of real-time scheduling that manage flexibly system movement are being progressed by using simulation. But because the existing researches are focused on state change of whole system and selected dispatching with real-time, it could not reflect the state changes of each work center accurately, Therefore, the main core of this paper is to examine the state of workcenter, to select the optimal dispatching dynamically through simulation, and to present the algorithm that can manage actively on state of workcenter. Also, performance measure was used the mean tardiness and mean flow time that are used existing researches.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.4
• /
• pp.67-86
• /
• 2002

This paper considers subway crew scheduling problem. Crew scheduling is concerned with finding a minimum number of assignments of crews to a given timetable satisfying various restrictions. Traditionally, crew scheduling problem has been formulated as a set covering or set partitioning problem possessing exponentially many variables, but even the LP relaxation of the problem is hard to solve due to the exponential number of variables. In this paper. we propose two basic techniques that solve the subway crew scheduling problem in a reasonable time, though the optimality of the solution is not guaranteed. We develop an algorithm that solves the column-generation problem in polynomial time. In addition, the integrality of the solution is accomplished by variable-fixing technique. Computational result for a real instance is reported.

• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.4
• /
• pp.266-279
• /
• 2009

This paper focuses on the problem of scheduling wafer lots with limited waiting times between pairs of consecutive operations in a semiconductor wafer fabrication facility. For the problem of minimizing total tardiness of orders, we develop a priority rule based scheduling method in which a scheduling decision for an operation is made based on the states of workstations for the operation and its successor or predecessor operation. To evaluate performance of the suggested scheduling method, we perform simulation experiments using real factory data as well as randomly generated data sets. Results of the simulation experiments show that the suggested method performs better than a method suggested in other research and the one that has been used in practice.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.12
• /
• pp.1053-1068
• /
• 2003

In this paper, we propose a new scheduling method without timing covert channel of real-time transaction for secure database systems that implement mandatory access control. Our scheduling method use the wait queue based on security level to remove timing covert channel. And it use priority queue that consider transaction type, deadline, and weight. Therefore, the proposed scheduling method prevents timing covert channel because it is kept noninterference between transactions with different security level, and maximizes the sum of the weight of transactions that satisfy its deadline. The simulation results, is a comparison of traditional methods, show that our scheduling method is improved to 30%.