本論文提出一套整合機制來支援具有不同即時性需求的工作。對於大部分的即時應用程式而言，其會由數種具有不同性質的工作所組成，像是硬即時性工作(hard real-time task)，軟即時性工作(soft real-time task) 與非即時性工作。且每一種工作，它們都有各自不同的需求，為了能夠有效地支援各種不同性質的工作，我們已經成功地設計出一個具有動態調整CPU頻寬功能的排程架構。
　　我們所提出的動態調整排程架構主要由兩大模組所組成，分別是排程模組與動態調整頻寬模組。排程模組主要負責安排工作的執行與回傳排程結果給動態調整頻寬模組，使得動態調整排程架構可以有效的調整 CPU 頻寬來讓所有的工作需求都能夠被滿足。簡而言之，我們可以藉由動態調整排程架構來達成以下的目標：
-保證每個週期硬即時性工作的可排程性(schedulability)，
-達到使用者可接受的非週期硬即時性工作接受率(ApHRT acceptance ratio)，
-提供足夠程度的服務品質(QoS) 給所有的軟即時性工作，
-保證非即時性工作的權重公平性 (weighted fairness)。
同時藉由理論分析與實驗結果，我們可得知此動態調整排程架構不僅有能力支援各種相異性質的工作且能有效地滿足各個工作的需求。

　　In this thesis, we propose a framework for scheduling heterogeneous tasks in a real-time system. A real-time application is composed of various kinds of tasks, such as hard real-time tasks, soft real-time tasks, and non-real-time tasks. Each kind of tasks has different requests on timing constraint. In order to support heterogeneous tasks effectively, we have designed an adaptive scheduling framework to support these diverse tasks.
　　The scheduler module and the adaptive bandwidth manager module are two main parts of our scheduling framework. The scheduler module plays the role of scheduling ready tasks and feedbacks scheduling results to the adaptive bandwidth manager, then it uses the scheduling results to tune corresponding CPU bandwidth of CBS, such that diverse requests of tasks can be satisfied. In summary, the proposed framework will achieve the following aims by our adaptive scheduling framework:
-Guaranteeing each periodic hard real-time task to be schedulable,
-Achieving desired acceptance ratio for the aperiodic hard real-time task set,
-Providing sufficient QoS level for soft real-time tasks, and
-Supporting the property of weighted fairness for non-real-time tasks.
With the analyses and simulation results, we can demonstrate our adaptive scheduling framework has the ability to support diverse real-time systems effectively.

[1] L. Deng and J. W.-S. Liu, and J. Sun. A scheme for scheduling hard
real-time appli- cations in open system environment. In Proceedings of
the 9th Euromicro Workshop on Real-Time Systems, June 1997.

[2] L. Abeni and G. Buttazzo. Adaptive bandwidth reservation for multimedia
computing. In proceedings of IEEE Conference Real-Time Computing Systems
and Applications, December 1999.

[3] Jin Soo Jang, Woo Hyun Ahn and Daeyeon Park. A server framework for
scheduling multimedia applications in open system environment . In
Proceedings of IEEE Con- ference Parallel and Distributed Systems, 2001

[4] C. L. Liu and J. Layland. Scheduling Algorithms for Multiprogramming in a
Hard Real-Time Environment. Journal of the ACM, 20(1):46-61, 1973.

[5] M. Spuri and G. Buttazzo. Scheduling aperiodic tasks in dynamic priority
systems. Real-Time Systems, 10(2), 1996.

[6] L. Abeni and G. Buttazzo. Integrating multimedia applications in hard
real-time systems. In Proceedings of the IEEE Real Time Systems
Symposium, Madrid, Spain, December 1998.

[7] R. E. Kalman, A New Approach to Linear Filtering and Prediction Problems,
Tran- saction of the ASME—Journal of Basic Engineering, pp.35-45, March
1960.

[8] L. Abeni. Server mechanisms for multimedia applications. Technical Report
RETIS TR98-01, Scuola Superiore S. Anna, 1998.

[9] Greg Welch and Gary Bishop. An Introduction to the Kalman Filter,
UNC-Chapel Hill, TR 95-041, March 2002.