在即時作業系統(RTOS)環境中，系統必須保證工作不但要正確執行，而且必須在時限內完成，才算成功。雖然在單處理器電腦上EDF(Earliest Deadline First)作業排班演算法已經是最佳的排班方式，但是在多處理器的即時系統排班上，由於過於複雜，目前尚未有最佳的排班演算法。雖然已有排班器來模擬多處理器即時系統，但在不可排班時，未必有提出適當的建議，讓決策者有較佳的解決方式。故在本篇論文中將提出一個適應性的排班器，除了利用模擬結果告知決策者是否可以進行排班，更在工作不可排班時，依據系統內相關的環境變數提出了相對的建議。並藉由此排班器協助決策者解決處理不可排班時之問題。

In the environment of RTOS, in order to determine its success, the system not only has to ensure the accuracy of task performance, but also finishes in time. Although EDF(Earliest Deadline First) on the uniprocessor computers has had operation scheduling algorithm as the best scheduling method, multiprocessor instant scheduling system, because of the complication, so far the best scheduling algorithm is still not available. Schedulers are available to simulate multiprocessor instant system, but proper suggestions might not be presented for users to comprehend better solutions while desired scheduling is impossible. Therefore, in this dissertation, the adaptive scheduler will be presented. Not only users will be informed whether it is acceptable to proceed scheduling by using simulation result, but also it will present comparative suggestions according to the related situation changes within the system under the circumstance of unsolved scheduling. In addition, the scheduler can assist users to solve scheduling.

[1]LaplanteA.Phillip. (2004). Real-time systems design and analysis : an engineer’s handbook. United states of America: New York : Institute of Electrical and Electronics Engineers.
[2]Michael SchiebePferrerSaskia. (1992). REAL-TIME SYSTEMS ENGINEERING AND APPLICATIONS. Boston/Dordrecht/London: KLUWER ACADEMIC PUBLISHERS.
[3]RajkumarRagunathan. (1991). SYNCHRONIZATION IN REAL-TIME SYSTEMS A Priority Inheritance Approach. Boston/Dordrecht/London: KLUWER ACADEMIC PUBLISHERS.
[4]Shem-Tov LeviK. AgrawalaAshok. (1990). REAL-TIME SYSTEM DESIGN. McGraw-Hill Publishing Company.
[5] Leung, J. Y.; Whitehead, J. (1982), "On the complexity of fixed-priority scheduling of periodic, real-time tasks", Performance Evaluation.
[6] Audsley, N. C. and Burns, A. and Richardson, M. F. and Wellings, A. J. (1991) real-time scheduling: the deadline-monotonic approach. in Proc. IEEE Workshop on Real-Time Operating Systems and Software .
[7] Liu, C. L., and J. W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real Time Environment,” Journal of the Association for Computing Machinery, vol.20, no.1, pp. 44-61, January 1973.
[8]Abeni,L.,and Buttazzo,G. 1998.Integrating multimedia applications in hard real time systems. In Proceedings of the 19th IEEE real-time Systems Symposium. Madrid, Spain.
[9] Paolo Valente and Giuseppe Lipari, “An Upper Bound to the Lateness of Soft Real-time Tasks Scheduled by EDF on Multiprocessor,” Proceedings of the 25th IEEE International Real-Time Systems Symposium, 10 pp. Dec. 2005.
[10] SYSTEMSREAL-TIME. (1993). Ian Pyle,Peter Hruschka,Michel Lissandre and Ken Jackson . Chichester/New York/Brisbane/Toronto/Singapore : JOHN WILEY& SONS.
[11] D.Oh and Baker. Utilization bounds for n-processor rate monotone scheduling with static processor assignment. Real-time System, 15(2):183-192,1998.
[12] Joel Goossens, Shelby Funk, Sanjoy Baruah, “ Priority-Driven Scheduling of Periodic Task Systems on Multiprocessor,” Real-Time Systems, vol. 25, no. 2-3, pp.
187 – 205, Sep. 2003
[13] ChengM. K. (Albert Mo Kim)Albert. (2002). Real-time systems : scheduling, analysis, and verification . Canada: John Wiley & Sons, Inc.