• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.59
• /
• pp.37-42
• /
• 2000

The parallel machines scheduling problems is one of the combinatorial optimization problems that often occurs in the real world. This problem is classified into two cases, one of which is the case which processing time are identical and the other, nonidentical. Not so much researches have been made on the case that nonidentical parallel machines scheduling problem. This study proposes Tabu Search methods for solving parallel machines scheduling problems related to due dates: minimizing mean tardiness, minimizing the number of tardy jobs, minimizing the maximum tardiness.

• Journal of information and communication convergence engineering
• /
• v.9 no.3
• /
• pp.341-346
• /
• 2011

Wireless sensor networks (WSNs) are formed by a great quantity of sensor nodes, which are consisted of battery-powered and some tiny devices. In WSN, both efficient energy management and Quality of Service (QoS) are important issues for some applications. Real-time services are usually employed to satisfy QoS requirements in critical environment. This paper proposes a real-time MAC (Medium Access Control) protocol with extended backoff scheme for wireless sensor networks. The basic idea of the proposed protocol employs (m,k)-firm constraint scheduling which is to adjust the contention window (CW) around the optimal value for decreasing the dynamic failure and reducing collisions DBP (Distant Based Priority). In the proposed protocol, the scheduling algorithm dynamically assigns uniform transmitting opportunities to each node. Numerical results reveal the effect of the proposed backoff mechanism.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.39 no.6
• /
• pp.36-46
• /
• 2002

This paper proposes an integrated scheduling mechanism for embedded system with real-time web server to meet the characteristics of real time task. The proposed scheduling mechanism may solve the so-called priority inversion problem in scheduling between urgent web requests and tasks with low priorities. The priority inversion problem happens because of operating two independent schedulers, web scheduler and operating system scheduler in a system without considering the requirements of each other. In the proposed mechanism, two schedulers are integrated in an operating system and the integrated scheduler schedules tasks for urgent web requests with real time characteristics and other application tasks together. Since all tasks are scheduled by one unified scheduler that knows the characteristics of tasks, the tasks are scheduled with their absolute priorities and thus the priority inversion problem can be eliminated. The performance is measured on a prototype embedded system with the proposed algorithm.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.7
• /
• pp.368-376
• /
• 2005

Multiprocessor architecture becomes increasingly common on real-time systems as computer hardware technology rapidly progresses and the workload of real-time systems increases. However, efficient solutions for many real-time multiprocessor scheduling problems are not known. Hence many researchers apply uniprocessor scheduling algorithms to multiprocessor scheduling or devise new algorithms based on these algorithms. Such algorithms are EDF (Earliest Deadline First), LLF (Least Laxity First), EDF-US[m/(2m-1)], and EDZL (Earliest Deadline Zero Laxity), and comparative studies on them are necessary. In this paper, we show the dominance relation of these algorithms with respect to schedulability, and we prove EDZL strictly dominates EDF. The simulation results show that EDZL has high processor utilization and it causes a small number of preemptions.

• Journal of the Society of Naval Architects of Korea
• /
• v.54 no.2
• /
• pp.102-112
• /
• 2017

Many studies on dynamic positioning control algorithms using fixed feedback gains have been carried out to improve station keeping performance of dynamically positioned vessels. However, the control algorithms have disadvantages in that it can not cope with changes in environmental disturbances and response characteristics of vessels motion in real time. In this paper, the Fuzzy Gain Scheduling - PID(FGS - PID) control algorithm that can tune PID gains in real time was proposed. The FGS - PID controller that consists of fuzzy system and a PID controller uses weighted values of PID gains from fuzzy system and fixed PID gains from Ziegler - Nichols method to tune final PID gains in real time. Firstly, FGS - PID controller, control allocation algorithm, FPSO and environmental disturbances were modeled using Matlab/Simulink to evaluate station keeping performance of the proposed control algorithm. In addition, simulations that keep positions and a heading angle of vessel with wind, wave, current disturbances were carried out. From simulation results, the FGS - PID controller was confirmed to have better performances of keeping positions and a heading angle and consuming power than those of the PID controller. As a consequence, the proposed FGS - PID controller in this paper was validated to have more effectiveness to keep position and heading angle than that of PID controller.

• Journal of Computing Science and Engineering
• /
• v.7 no.1
• /
• pp.30-43
• /
• 2013

Multicore and multiprocessor systems with dynamic voltage scaling architectures are being used as one of the solutions to satisfy the growing needs of high performance applications with low power constraints. An important aspect that has propelled this solution is effective task/application scheduling and mapping algorithms for multiprocessor systems. This work proposes an energy aware, offline, probability-based unified scheduling and mapping algorithm for multiprocessor systems, to minimize the number of processors used, maximize the utilization of the processors, and optimize the energy consumption of the multiprocessor system. The proposed algorithm is implemented, simulated and evaluated with synthetic task graphs, and compared with classical scheduling algorithms for the number of processors required, utilization of processors, and energy consumed by the processors for execution of the application task graphs.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.12
• /
• pp.17-27
• /
• 2022

In this paper, ED-H algorithm, an optimal real-time scheduling algorithm dealing with the characteristics of the integrated energy harvester system with a capacitor, is extended to satisfy the time constraint under the blackout state which is a deliberate power-off state by an intelligent power management unit adopted in the system. If the power supply system does not have enough energy, it temporarily shuts off the power supply to protect the circuit and capacitor and resumes the supply again when the capacitor is fully charged, which may delay the task execution during these blackout states by calculating the time according to the occurrence of the events. To mitigate the problem, even if task execution is delayed by the original ED-H algorithm, the remaining time of the subsequent time units no longer can afford to delay the execution of the task is predicted in the extended algorithm and the task is forced to be scheduled to meet the time deadline. According to the simulation results, it is confirmed that the algorithm proposed in this paper has a high scheduling performance increase of 0.4% to 7.7% depending on the characteristics of the set of tasks compared to the ED-H.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.1
• /
• pp.62-68
• /
• 2005

This paper presents a scheme to enhance fixed priority scheduling algorithms on multiprocessors. This scheme gives the highest priority to jobs with zero laxity and schedules them Prior to other jobs. A fixed priority algorithm employing this scheme strictly dominates the original one; it can schedule all task sets schedulable by the fixed priority algorithm and some task sets not schedulable by the fixed priority algorithm. Simulation results show that the proposed scheme improves fixed priority algorithms in terms of the number of schedulable task sets and schedulable utilization bound.

• The Journal of the Korea Contents Association
• /
• v.6 no.9
• /
• pp.28-41
• /
• 2006

Recently, Baruah et.al. proposed an optimal Pfair scheduling algorithm in the hard real-time multiprocessor environments, and several variants of it were presented. All these algorithms assume the fixed unit quantum size, and this assumption has two problems in the mode change environments. If the quantum size is too large, it results in the scheduling failure due to the decreased processor utilization. If it is too small, it increases the frequency of scheduling points, and it incurs the task switching overheads. In this paper, we propose several methods that determine the maximum quantum size dynamically such that the task set can be scheduled in the mode change environments.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.4
• /
• pp.820-822
• /
• 2010

Mobile WiMAX system provides various classes of traffic such as real-time and non-realtime services. These services have different QoS requirements and the QoS aware scheduling has been an important issue. Although many of scheduling algorithms for various services in OFDMA system have been proposed, it is needed to be modified to be applied to Mobile WiMAX system. Since Mobile WiMAX supports five kinds of service classes, it is important to take QoS characteristics of each class into consideration. In this paper, we propose an efficient packet scheduling algorithm to support QoS of each class. Proposed scheme selects a service class first considering QoS Characteristics of each class and choose an appropriate user in the selected class. Simulation results show that the proposed algorithm has better performance than the other algorithm.