• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.2
• /
• pp.68-77
• /
• 2003

The Least-Laxity First(or LLF) scheduling algorithm assigns the highest priority to a task with the least laxity, and has been proved to be optimal for a uni-processor and sub-optimal for a multi-processor. However, this algorithm Is Impractical to implement because laxity tie results in the frequent context switches among tasks. In this paper, a Modified Least-Laxity First on Multiprocessor(or MLLF/MP) scheduling algorithm is proposed to solve this problem, i.e., laxity tie results in the excessive scheduling overheads. The MLLF/MP is based on the LLF, but allows the laxity inversion. MLLF/MP continues executing the current running task as far as other tasks do not miss their deadlines. Consequently, it avoids the frequent context switches. We prove that the MLLF/MP is also sub-optimal in multiprocessor systems. By simulation results, we show that the MLLF/MP has less scheduling overheads than LLF.

• Journal of Korea Multimedia Society
• /
• v.22 no.4
• /
• pp.515-526
• /
• 2019

DOOH(Digital Out Of Home) advertising targets for reaching consumers through outdoor digital display medias. Traditionally, scheduling of advertisement contents over DOOH medias is usually done by operator's strategy, but an efficient ad scheduling strategy is not easy to find under various advertising contexts. In this paper, we present a context-aware factorization machine-based recommendation model for the scheduling under various advertising contexts, and provide analysis for understanding of the contexts' effects on advertising based on the recommendation model. Through simulation results on the dataset adapted from a real dataset of RecSys challenge 2015, it is shown that the proposed model and analysis based on the model will be effective for better scheduling of ad contents under advertising contexts over DOOH networks.

• Journal of Computing Science and Engineering
• /
• v.2 no.1
• /
• pp.74-97
• /
• 2008

A scheduling policy or a schedulability test is defined to be sustainable if any task system determined to be schedulable remains so if it behaves "better" than mandated by its system specifications. We provide a formal definition of sustainability, and subject the concept to systematic analysis in the context of the uniprocessor scheduling of periodic and sporadic task systems. We argue that it is, in general, preferable engineering practice to use sustainable tests if possible, and classify common uniprocessor schedulability tests according to whether they are sustainable or not.

• Journal of Information Technology Services
• /
• v.16 no.3
• /
• pp.103-111
• /
• 2017

The real time scheduling is a key research area in high performance computing and has been a source of challenging problems. A periodic task is an infinite sequence of task instance where each job of a task comes in a regular period. The RMS (Rate Monotonic Scheduling) algorithm has the advantage of a strong theoretical foundation and holds out the promise of reducing the need for exhaustive testing of the scheduling. Many real-time systems built in the past based their scheduling on the Cyclic Executive Model because it produces predictable schedules which facilitate exhaustive testing. In this work we propose hybrid scheduling method which combines features of both of these scheduling algorithms. The original rate monotonic scheduling algorithm didn't consider the uniform sampling tasks in the real time systems. We have enumerated some issues when the RMS is applied to our hybrid scheduling method. We found the scheduling bound for the hard real-time systems which include the uniform sampling tasks. The suggested hybrid scheduling algorithm turns out to have some advantages from the point of view of the real time system designer, and is particularly useful in the context of large critical systems. Our algorithm can be useful for real time system designer who must guarantee the hard real time tasks.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.18 no.3
• /
• pp.129-149
• /
• 1993

The high level of activity in the development and maintenance of computer software makes the scheduling of software projects an importnat factor in reducing operating costs and increasing competitiveness. Software activity is labor intensive. Scheduling management of hours of software work is complicated by ther interdependencies between the segments of work, and the uncertainties of the work itself. This paper discusses issues of scheduling in software engineering management, and presents a modular decomposition model for software project scheduling, taking advantage of the facility for decomposition of a software project into relatively independent work segment modules. Modular decomposition makes it possible to treat scheduling as clustering and sequencing in the context of integer programming. A heuristic algorithm for the model is presented with some computational experiments.

• Journal of the Korean Institute of Navigation
• /
• v.18 no.2
• /
• pp.57-67
• /
• 1994

This paper treats the optimization analysis of tactical ship scheduling problems in the world seaborne bulk trade. The authors use the term 'tactial' to describe the ship scheduling problem where the owners should employ skillful tactics as an expedient toward gaining the higher profits per period in short term. Relevent research and related problems on ship scheduling problems are reviewed briefly and a model for the tactical ship scheduling problem formulated as Set Problem is introduced by modifying the previous work of Fisher(1989). The reality and practicability of the model is validated by some ship-ping statistics. Proper solution approaches are outlined in the context of computational tractability in tackling the Mixed Integer Propramming. Some underlying consideration for the computational experiment is also mentioned. The authors conclude the paper with the remarks on the need of user-friendly Decision Support System for ship scheduling under varying decision environment.

• 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 Communications and Networks
• /
• v.11 no.5
• /
• pp.489-499
• /
• 2009

We describe the fundamental issue of scheduling the allocation of wireless network resources and provide several formulations of the associated problems. The emphasis is on scheduling transmission attempts. We place this problem in the context of existing approaches, like information theoretic and traditional network theoretic ones, as well as novel avenues that open up the possibility of addressing this issue for non-stationary and non-ergodic environments. We summarize concrete recent results for specific special cases that include unicast and multicast traffic, different objective functions, and reduced complexity versions of the problem. We conclude with some thoughts for future work. We identify and single out the cross-layer nature of the problem and include a simple physical-layer criterion in what is mostly a medium access control (MAC) problem.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.5 no.3
• /
• pp.128-135
• /
• 2010

Recently complexity of embedded software cause to be used real-time operating system (RTOS) to implement various functions in the embedded system. And also, according to requirement of complex functions in embedded systems, the number as well as complexity of tasks get increased continuously. In case that many tasks collaborated in a microprocessor, context switching time between tasks is a overhead waisting a CPU resource. Therefore the time of task context switching is an important factor that affects performance of RTOS. In this paper, we concentrate on the improvement of task context switch for reducing overhead and achieving fast response time in RTOS. To achieve these goal, we suggest multiple register files and task context switching algorithm. By reducing the context switch overhead, we try to ease scheduling and assure fast response times in multitasking environment. As a result, the context switch overhead decreased by 8~16% depend on the number of register files, and some task set which are not schedulable with single register file are schedulable due to that decrease with multiple register files.

• Journal of Information Processing Systems
• /
• v.5 no.4
• /
• pp.175-186
• /
• 2009

Power consumed by modern computer systems, particularly servers in data centers has almost reached an unacceptable level. However, their energy consumption is often not justifiable when their utilization is considered; that is, they tend to consume more energy than needed for their computing related jobs. Task scheduling in distributed computing systems (DCSs) can play a crucial role in increasing utilization; this will lead to the reduction in energy consumption. In this paper, we address the problem of scheduling precedence-constrained parallel applications in DCSs, and present two energy- conscious scheduling algorithms. Our scheduling algorithms adopt dynamic voltage and frequency scaling (DVFS) to minimize energy consumption. DVFS, as an efficient power management technology, has been increasingly integrated into many recent commodity processors. DVFS enables these processors to operate with different voltage supply levels at the expense of sacrificing clock frequencies. In the context of scheduling, this multiple voltage facility implies that there is a trade-off between the quality of schedules and energy consumption. Our algorithms effectively balance these two performance goals using a novel objective function and its variant, which take into account both goals; this claim is verified by the results obtained from our extensive comparative evaluation study.