• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11b
• /
• pp.1631-1634
• /
• 2002

멀티미디어 서버는 클라이언트가 요청한 멀티미디어 데이터 스트림을 효율적으로 제공하기 위해 사용된다. 현재, 정보통신 기술의 발달로 인해 멀티미디어 서버는 멀티미디어 정보를 온라인으로 서비스 할 수 있게 되었다. 하지만 네트워크 상에서 발생하는 Packet Delay 에 때문에 서버에서 사용자에게 연속적이고 엄격한 실시간 제약이 있는 비디오 전송과 같은 멀티미디어 서비스를 제공하는 것은 매우 힘들다. 따라서, 본 논문에서는 서버에서 필요한 Packet 를 먼저 전송하여 Packet Delay 를 줄이는 방법을 제안하였다. MPEG-4 에서 오브젝트의 AU(Access Unit)들의 디코딩 시간을 표시하는 DTS(Decoding Time Stamp)를 참조하여 생성된 Deadline threshold 를 기준으로 Deadline 이 가장 빠른 AU부터 전송하는 스케줄링 알고리즘을 이용하여 MPEC-4 미디어 오브젝트를 스트리밍한다.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.8
• /
• pp.594-601
• /
• 2004

We analyze checkpoint strategy for multiple real-time periodic tasks with hard deadlines. Real-time tasks usually have deadlines associated with them. For multiple real-time tasks, checkpoint strategy considering deadlines of all tasks is very difficult to derive. We analyze the problem of checkpoint placement for such multiple periodic tasks. In our strategy, the interval between checkpoints is determined for each task considering its deadline. An approximated failure probability over a specified interval is derived. Then the number of checkpoints for each task is selected to minimize the approximated failure probability. To show the usefulness of our strategy, error bound between the exact and the approximated failure probability is estimated, which is revealed to be quite small.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.202-204
• /
• 2003

경성 실시간 시스템(Hard Real-Time System)어서는 주기 태스크들의 엄격한 마감시간(Deadline) 보장이 시스템의 성능을 좌우한다. 본 논문에서는 CPU의 이용률(Utilization)이 높아 비율단조 정책으로는 마감시간을 보장 할 수 없는 주기 태스크들을 위해 확장된 스케줄 가능성 검사를 통해 수행할 태스크들의 공통 주기(L.C.M : Least Common Multiple)내에서 EDF(Earliest-Deadline First) 정책을 기반으로 마감시간 보장 수행패턴(Feasible Pattern)을 찾고, 이를 참조하여 우선순위를 고려하지 않고 태스크들을 강제 수행할 수 있게 하는 비율단조 기반의 스케쥴링 기법을 제안한다. EDF를 기반으로 생성된 패턴은 EDF 정책의 특성에 따라 CPU의 이용률을 100% 까지 가능하게 하며 패턴을 참조하여 강제 수행함으로써 EDF 정책이 갖는 실행시간 스케쥴링 오버헤드를 없앨 수 있다.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.1
• /
• pp.148-154
• /
• 2012

For a successful checkpointing strategy, we should place checkpoints so as to optimize fault-tolerance capability of real-time systems. This paper presents a novel scheme of checkpoint placement for real-time systems with periodic multi-tasks. Under the influence of transient faults, multi-tasks are scheduled by the Rate Monotonic (RM) algorithm. The optimal checkpoint intervals are derived to maximize the probability of task completion. In particular, this paper is concerned about the general case that the deadline of a task is longer than the period. Compared with the special condition that the deadline is equal to or less than the period, this general case causes a more complicate test procedure for schedulability of the RM algorithm with respect to a given set of checkpoint re-execution vectors. The probability of task completion is also derived in a more complex form. A case study is given to show the applicability of the proposed scheme.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10c
• /
• pp.370-372
• /
• 2002

다중처리기 상에서 실시간 태스크 스케줄링에 대한 연구가 현재 많이 수행되고 있지만, 주로 Pfair(P-fairness)와 EDF(Earliest Deadline First) 알고리즘에 대한 연구이다. Pfair는 이론적인 연구에 초점을 두고 있으며, EDF는 처리기들을 효율적으로 이용하지 못하는 문제점을 가지고 있다. 본 논문에서는 다중처리기 상의 주기적인 실시간 태스크 집합을 대상으로, LLA(Least Laxity Algorithm) 알고리즘이 높은 스케줄링 가능성(schedulability)을 가짐을 먼저 보인다. 다음으로 기존 알고리즘들의 문제점을 보완하기 위해 EDF와 LLA를 결합한 ED/LL(Earliest Deadline/Least Laxity)이라는 알고리즘을 제시한다. ED/LL은 LLA보다 문맥교환 횟수는 적고 EDF보다 스케줄링 가능성이 높으며, 구현 오버헤드도 크지 않다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4349-4371
• /
• 2019

Moldable parallel tasks are widely used in different areas, such as weather forecast, biocomputing, mechanical calculation, and so on. Considering the deadline and the speedup, scheduling moldable parallel tasks becomes a difficulty. Past work majorly focuses on the LA (List Algorithms) or OMA (Optimizing the Middle Algorithms). Different from prior work, our work normalizes execution time and makes all tasks have the same scope in normalized execution time: [0,1], and then according to the normalized execution time, a method is used to search for the reference execution time without considering the deadline of tasks. According to the reference execution time, we get an initial scheduling result based on AFCFS (Adaptive First Comes First Served) policy. Finally, a heuristic approach is used to improve the performance of the initial scheduling result. We call our method HSRET (a Heuristic Scheduling method based on Reference Execution Time). Comparisons to other methods show that HSRET has good performance in AWT (Average Waiting Time), AET (Average Execution Time), and PUT (Percentages of Unfinished Tasks).

• Journal of Korea Multimedia Society
• /
• v.2 no.4
• /
• pp.378-389
• /
• 1999

Parallel tasks in distributed real-time systems can be divided into several subtasks and be executed in parallel according to their real-time attributes. But, it is difficult to gain the optimal solution which is to allocate a tasks deadline into the subtasks deadline while minimizing the subtasks deadline miss. Tn this Paper, we propose the algorithm that allocates deadlines into each subtask, according to the attributes of each subtask(i.e. using communication time and execution time to periodic tasks). Also, we suggest a processor mapping algorithm that considers the communication time among the processors and the effective duplication algorithm which is allocated to the identical processor for the purpose of improving the communication time between the subtasks. We can obtain a result that reduces IPC(Inter-Processor Communication) time and uses the idle processor through applying effective real-time attributes to FUTD(Fully connected, Unbounded Task Duplication) algorithms. As a result, we can improve the average processor utilization.

• Journal of Korea Multimedia Society
• /
• v.12 no.5
• /
• pp.617-632
• /
• 2009

In this paper we propose a technique of implementing the reconfigurable network protocol stack that allows for partitioning network protocol functions into software and hardware tasks on a SoC (System on Chip) platform. Additionally, we present a method that guarantees the deadline of both an individual task and messages exchanging among tasks in order to meet the deadline of real-time multimedia and networking services. The proposed real-time message exchange method guarantees the deadline of messages generated by multimedia services that are required to meet the real-time properties of multimedia applications. After implementing the networking functions of TCP/IP protocol suite into hardware and software tasks, we verify and validate their performance on the SoC platform. Experimental results indicate that the proposed technique improves the performance of TCP/IP protocol suit as well as application service satisfaction in application-specific real-time.

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

• The Journal of the Korea Contents Association
• /
• v.13 no.10
• /
• pp.27-36
• /
• 2013

Recently, as researches on VANET have actively progressed, the convenient and reliable services can be provided to the vehicles. In this paper, we propose the collaborative RSU scheduling scheme using multiple RSUs which are connected through a wired backbone. The proposed scheme efficiently disseminates both unsafety data and safety data, and reduces the deadline miss rate and the average response time. When safety data is occurred, it is send to previous RSU in advance and is scheduled by deadline and reception rate. We provide the prevention technology for unsafety data when the workload is occurred in RSU because it is on-demand data processed by user requests. It is shown through performance evaluation that the proposed scheme outperforms the existing scheme in terms of the deadline miss rate and the average response time according to the number of vehicles and the velocities of vehicles.