• Journal of the Korea Society of Computer and Information
• /
• v.12 no.3
• /
• pp.147-153
• /
• 2007

Task scheduling is an essential part of any computer system for allocating tasks to a processor of the system among various competitors. As we know, in real-time system, the failure of scheduling a hard real-time task my lead to disastrous consequence. Besides efficiency, resource and speed, real-time system has to take time constraint in serious consideration. This paper proposes a priority-driven scheduling algorithm for real-time multiprocessor system. which is called L-RE coordinates algorithm. L-RE coordinates is a new way of describing the task scheduling problem. In the algorithm, we take both deadline and laxity into consideration for allocating the priority. The simulation result shows that the new algorithm is viable and performance better than EDF and LLF algorithm on schedulability and context switch respectively.

• Journal of Digital Convergence
• /
• v.16 no.1
• /
• pp.317-325
• /
• 2018

A satisfactory ending of the project is crucial for the students to achieve success experience. In this study, we analyze the teams' dismantling before the project deadline. We propose a team dissolution model based on the assumption that the disharmony caused by the members' personality traits is the main reason for the team break up. The Dark Triad and the Communion are introduced to build the model. We simulated the proposed model using an agent-based simulation and analyzed the results. We found that the ratio of owning DT impacts the maximum allowable size of the team and the team's rate of dissolution, but the team has been able to reduce the team's dissolution rate by increasing the team's harmony. We expect that we efficiently used the developed model with the agent-based simulation for the studies related to the dismantling of teams.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11
• /
• pp.3519-3533
• /
• 2000

In a VOD(Video-On-Demand) system, I/O performance and storage requirements are generally more important than computing capability, Due to the development of CPU tecnology, the gap between the performance of processors and desk speed are widening. Therefore, the disk system typically becomes the bohleneck ina VOD system. In order to allevte those effects from physical constramts, disk array system is used. The I/O performance of disk arrays can be improved by the capability of processors, I/O schefuling polcy, the number of member disks in the array, disk block size, block placemet method etc. In this paper, we considered the disk scheduling schemes including EDF( Earliest Deadine First), SCAN, SGAN-EDF, Round-robm. GSS(Grouped Sweeping scheme), and C-SCAN, LOOK, C-LOOK which are variations of SCAN Mamly focusing on those disk scheduling schemes, we performed the simulation in order to compare and eview the perionmance of disk arrays considening seveial related parameters under diverse environments and analyzed the effects of those parameters to the performance.

• The Journal of the Korea Contents Association
• /
• v.10 no.1
• /
• pp.103-113
• /
• 2010

The basic real-time scheduling algorithms based on RM or EDF approaches assume that the tasks are preemptive, but the tasks may contain nonpreemptive sections in many cases. Also the existing scheduling algorithm for reducing the power consumption of the processor is based on the task utilizations and determines the processor speed $S_H$ or $S_L$ according to the existence of the blocking intervals. In this algorithm, the $S_H$ interval that operates in high speed is the interval during which the priority inversion by blocking occurs, and the length of this interval is set to the task deadline that includes the blocking intervals. In this paper, we propose an improved algorithm that can reduce the power consumption ratio by shortening the length of the $S_H$ interval. The simulation shows that the power consumption ratio of the proposed algorithm is reduced as much as 13% compared to the existing one.

• The Journal of the Korea Contents Association
• /
• v.10 no.1
• /
• pp.94-102
• /
• 2010

In recent years, embedded systems such as cellular phones, Portable Multimedia Player, intelligent appliance, automobile engine control are reshaping the way people live, work, and play. Thereby, services application to guarantee various requirements of users become increasingly sophisticated and complicated, such embedded computing platforms use real-time operating systems (RTOSs) with time determinism. These RTOSs must not only provide predictable services but must also be efficient and small in size. Kernel services should also be deterministic by specifying how long each service call will take to execute. Having this information allows the application designers to better plan their real-time application software so as not to miss the deadline of each task. In this paper, we present the complete generalized real-time scheduling algorithm using multi-dimensional methodology to determine the highest priority in the ready list with 2r levels of priorities in a constant time without additional memory overhead.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.2
• /
• pp.31-39
• /
• 2013

In this paper, we propose a power-efficient scheduling scheme that stochastically minimizes the power consumption of a real-time parallel task while meeting the deadline on multicore processors. The proposed scheme applies the parallel processing that executes a task on multiple cores concurrently, and activates a part of all available cores with unused cores powered off, in order to save power consumption. It is proved that the proposed scheme minimizes the mean power consumption of a real-time parallel task with probabilistic computation amount on DVFS-enabled multicore processors with a finite set of discrete clock frequencies. Evaluation shows that the proposed scheme saves up to 81% power consumption of the previous method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10C
• /
• pp.1469-1483
• /
• 2004

We propose a packet scheduling algorithms for streaming media. We assume that the receiver periodically reports back the channel throughput. From the original video data, the importance level of a video packet is determined by its relative position within its group of pictures, taking into account the motion-texture discrimination and temporal scalability. Thus, we generate a number of nested substreams. Using feedback information from the receiver and statistical characteristics of the video, we model the streaming system as a queueing system, compute the run-time decoding failure probability of a Same in each substream based on effective bandwidth approach, and determine the optimum substream to be sent at that moment in time. Since the optimum substream is updated periodically, the resulting sending order is different from the original playback order. From experiments with real video data, we show that our proposed scheduling scheme outperforms the conventional sequential sending scheme.

• Journal of Information Technology and Architecture
• /
• v.9 no.4
• /
• pp.443-453
• /
• 2012

In order to minimize the damage from system failures, systems over various fields are requested to contain the safety-critical features. In this paper, we deliver the considerable issues, especially, in the cyber physical systems that is recently used as a safety-critical system, as well as we propose the model driven architecture based on time as its the important factor. Based on meta-modeling approach, we introduce the time-based architecture which is associated with deadline, transition state, and threshold, and also we work out a design for this by using model driven architecture. We propose a realizable safety-critical architecture by means of showing failure handling components with safety transaction model from the meta-model. In the detailed models and the example, we design a basic safety processing state, a multiple safety processing state, and a compound safety processing state for completing the safety-critical system architecture.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.11
• /
• pp.2665-2670
• /
• 2015

VANET is ad-hoc network in which vehicles are treated as node and these nodes are communicating with each other as well as RSUs on the road. In VANET, scheduling is a very important issue as the request data are to be delivered to the recipient vehicle properly and accurately. It is also critical that any request data which is sent to the vehicle is received by it in the time period for which the vehicle will be in range of RSU. RSU picks the one with the highest priority to serve based on the scheduling scheme. In this paper, we propose a scheduling algorithm to select the one with the highest priority in RSU, in which an RSU can transfer the overload requests to other RSUs. We use the modified DBP scheme to calculate the priority of request data. Simulation results show that our scheme outperforms other scheduling schemes under various conditions.

• The KIPS Transactions:PartA
• /
• v.9A no.1
• /
• pp.9-18
• /
• 2002

In this paper, we propose scalable scheduling techniques based on EDF to efficiently integrate hard real-time and multimedia soft real-time tasks in the distributed real-time multimedia database system. Hard tasks are guarangteed based on worst case execution times, whereas multimedia soft tasks are served based on mean execution times. This paper describes a served-based scheme for partitioning the CPU bandwidth among different task classes that coexist in the same system. To handle the problem of class overloads characterized by varying number of tasks and varying task arrival rates, thus scheme shows how to adjust the fraction of the CPU bandwidth assigned to each class. This scheme fixes the maximum time that each hard task can execute in the period of the server, whereas it can dynamically change the bandwidth reserved to each multimedia task. The proposed method is capable of minimizing the mean tardiness of multimedia tasks, without jeopardizing the schedulability of the hard tasks. The performance of this scheduling method is compared with that of similar mechanisms through simulation experiments.