• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.1 no.2
• /
• pp.159-168
• /
• 1997

This paper presents a mechanism which supplies tasks with fast turn-around time on real-time multimedia environments. Tasks are classified into periodic and aperiodic tasks according to their executing period, and the types of them are classified into three groups : critical tasks, essential tasks and common tasks by the degree of its urgency. In the case of periodic tasks, we defer the execution of it within the extent to keep the deadline as long as possible and serve the aperiodic tasks, and provide aperiodic tasks with fast turn-around time. Changing the priority of each task is allowed within the same type and it is scheduled by using the dynamic priority. The emergency tasks are executed within deadline in any circumstances, and the least laxity one is served first when many real-time tasks are waiting for execution. The result of simulation shows that the proposed mechanism is better than the EDZL, known as suboptimal in multiprocessor systems, in the point of rum-around time.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06d
• /
• pp.234-237
• /
• 2007

IEEE 802.16 광대역 무선 접속망에서 QoS 보장을 위한 스케줄링 기법은 매우 중요하고 활발히 연구되고 있는 분야중 하나이다. 현재 IEEE 802.16 표준에 QoS 보장을 위한 메커니즘들이 정의되어 있지만 실제로 이것에 대한 시스템 구현은 설계자의 몫이다. 또한 기존에 제안 되었던 메커니즘은 각 커넥션들이 요구하는 서비스 품질을 만족시키지 못 하고 있다. 특히 딜레이에 민감한 rtPS 서비스 플로우에 대한 특성화된 스케줄링 매커니즘의 필요성이 대두되고 있다. 따라서 본 논문은 IEEE 802.16 표준에 정의된 4가지 QoS Class들중 실시간 서비스 및 멀티미디어 서비스 클래스인 rtPS 클래스에 대하여 각각의 커넥션이 높은 QoS를 만족할 있도록 ACK 정보를 이용한 스케줄링을 제안한다. 최종적으로 NS-2 시뮬레이터를 이용한 실험결과를 통해 성능 향상 시키는 것을 확인할 수 있었다.

• The KIPS Transactions:PartA
• /
• v.18A no.4
• /
• pp.143-150
• /
• 2011

This paper presents an EDF based scheduling algorithm for scheduling imprecise computation model where each task consists of mandatory part and optional part. Imprecise computation is useful to manage overload condition. In overload situation, some optional parts should be removed. The proposed DOP algorithm removes optional parts of earlier deadline tasks to enhance flexibly for newly arriving tasks. A simulation result shows that DOP has better performance than other algorithms.

• Journal of Platform Technology
• /
• v.11 no.2
• /
• pp.66-75
• /
• 2023

Hydrological survey measurement technology has improved due to the introduction of high-tech equipment and advances in technology, but hydrological survey still requires a lot of manpower and time, and the manpower invested is very limited compared to the size and scope of work. In addition, although automatic flow measurement facilities are in operation, it is difficult to expand them nationwide due to limited field conditions. Therefore, it is necessary to improve the operating infrastructure and environment rather than the measurement technology itself for hydrological investigation. In addition, in terms of flow investigation, it is necessary to schedule an investigation using real-time water level information in order to inventory the accuracy of the water-flow relationship equation and improve work efficiency. Therefore, in this paper, research related to domestic hydrological surveys was analyzed and a hydrological survey scheduling system using real- time water level information based on Open API was implemented to increase the economic and efficiency of hydrological surveys.

• Journal of Digital Convergence
• /
• v.12 no.3
• /
• pp.227-235
• /
• 2014

Mobile virtualization is an approach to mobile device management in which two virtual platforms are installed on a single wireless device. A smartphone, a single wireless device, might have one virtual environment for business use and one for personal use. Mobile virtualization might also allow one device to run two different operating systems, allowing the same phone to run both RTOS and Android apps. In this paper, we propose the techniques to virtualize the cores of a multicore, allowing the reassign any number of vCPUs that are exposed to a OS to any subset of the pCPUs. And then we also propose the real-time scheduling method to assigning the vCPUs to the pCPU. Suggested technology in this paper solves problem that increases time of real-time process when interrupt are handled, and is able more to fast processing than previous algorithm.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.1511-1514
• /
• 2009

이기종(異機種) 시스템환경에서 발생하는 수많은 로그 데이터는 중요도에 따라 실시간 로그 분석이 필요하고 대용량의 로그 데이터의 경우 특정 시간내에 로그 분석 처리를 종료해야만 한다. 보안에 관련된 로그 정보의 경우 실시간 분석과 빠른 통계 처리를 요구할 것이며, 대용량의 비실시간성 로그 분석의 경우 로그 분석 및 통계처리를 주어진 특정 시간 내에 하여야 한다. 본 논문에서는 로그 데이터의 중요도에 따른 실시간 로그 분석 처리와 비실시간 대용량 통계 로그의 로그 분석 처리 마감 시간을 충족하는 로그 분석 스케줄링 정책을 제안한다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.1
• /
• pp.22-32
• /
• 2003

Many of multimedia applications in distributed environments generate the packets which have the real-time characteristics for continuous audio/video data and transmit them according to the teal-time task scheduling theories. In this paper, we model the traffic for continuous media in the distributed multimedia applications based on the high-bandwidth networks and introduce the PDMA algorithm which is the hard real-time task scheduling theory for guaranteeing QoS requested by the clients. Furthermore, we propose the admission control to control the new request not to interfere the current services for maintaining the high quality of services of the applications. Since the proposed admission control is sufficient for the PDMA algorithm, the PDMA algorithm is always able to find the feasible schedule for the set of messages which satisfies it. Therefore, if the set of messages including the new request to generate the new traffic. Otherwise, it rejects the new request. In final, we present the simulation results for showing that the scheduling with the proposed admission control is of practical use.

• 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.

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

In this paper, we propose a scheduling strategy for grid environment that reduces resource cost. This strategy considers resource cost and job failure rate to efficiently allocate local computing resources. The key idea of our strategy is that we use two-level scheduling using remote and local scheduler. The remote scheduler determines the expected total execution times of jobs using the current network and local system status maintained in its resource database and allocates jobs with minimum total execution time to local systems. The local scheduler recalculates the waiting time and execution time of allocated job and uses it to determine whether the job can be processed within the specified deadline. If it cannot finish in time, the job is migrated other local systems, through simulation, we show that it is more effective to reduce the resource cost than the previous Greedy strategy. We also show that the proposed strategy improves the performance compared to previous Greedy strategy.

• The KIPS Transactions:PartA
• /
• v.10A no.3
• /
• pp.181-188
• /
• 2003

We propose a heuristic on-line scheduling algorithm for the IRIS (Increasing Reward with Increasing Service) tasks, which has low computation complexity and produces total reward approximated to that of previous on-line optimal algorithms. The previous on-line optimal algorithms for IRIS tasks perform scheduling on all tasks in a system to maximize total reward. Therefore, the complexities of these algorithms are too high to apply them to practical systems handling many tasks. The proposed algorithm doesn´t perform scheduling on all tasks in a system, but on (constant) W´s tasks selected by a predefined task selection policy. The proposed algorithm is based on task selection policies that define how to select tasks to be scheduled. We suggest two simple and intuitive selection policies and a generalized selection policy that integrates previous two selection policies. By narrowing down scheduling scope to only W´s selected tasks, the computation complexity of proposed algorithm can be reduced to O(Wn). However, simulation results for various cases show that it is closed to O(W) on the average.