查詢結果分析
來源資料
相關文獻
- Aperiodic Task Scheduling for Distance--Constrained Real-Time Systems
- Scheduling Non-Periodic Static Jobs in Fault Tolerant Real-Time System
- Bicriteria Dynamic Scheduling in Multi-Machine Flowshop
- 通勤行為與小客車需求混合需求模型之研究
- A Non- Preemptive Algorithm for Static Job Scheduling in Fault Tolerant Real- Time System
- 使用遺傳演算法求解二機開放工場具工作連接性限制問題
- 以組織理論與管理觀點探討國內建築師事務所執業之發展
- An O (n[feb4])Algorithm for Scheduling Tasks with Precedence Constraints and Time-Dependent Execution Time
- An Efficient Algorithm for Multiprocessor Scheduling Problems
- 工作母機遠距離操作的在家管理系統
頁籤選單縮合
題名 | Aperiodic Task Scheduling for Distance--Constrained Real-Time Systems=在距離限制下即時系統的非週期性工作排程 |
---|---|
作者 | 林晉豐; |
期刊 | 華夏學報 |
出版日期 | 19921200 |
卷期 | 26 1992.12[民81.12] |
頁次 | 頁9585-9605 |
分類號 | 494.51 |
語文 | eng |
關鍵詞 | 工作; 即時系統; 非週期性; 排程; 距離; |
中文摘要 | 在傳統即時系統中,某工作的周期p及執行時間e,二個連續工作完成時間的距離可能是 e (緊接在一起) 或2p-e(二連續週期的最遠兩端)。在距離限制下的即時系統中,對於某一週期性工作的連續二次工作不同的完成時間小於或等於某一個值稱為距離 (distance)。這樣,可能不適用於許多即時系統。 所謂非週期性工作可能有較不嚴格的截止時間 (soft deadline),我們希望得到一個較低的平均反應時間。同樣的,偶發工作 (sporadic task),可視為一個要求最小到達時間差之嚴格截止時間 (minimum interarrival time) 的工作。我們研究包含考慮距離限制的週期性工作,非週期性工作和偶而發生工作的即時系統排程。 在本論文中,我們使用二個不同整數(two-distinct-integer) 方法來找出合乎偶發工作的嚴格截止時間並且提供一個演算法來解決非週期性工作的排程。對於非週期性工作,我們提供固定服務處,保留服務處和偶發工作服務處來增加非週期性工作的執行機會。服務處可由二個不同整數方法來獲得,先找到幾個整數值給週期性工作,多餘的值則 作為非週期性工作的服務處。固定服務處可用多餘的整數值經由固定排程順序很容易的完成;而保留服務處的排程則較為複雜,利用交換相同距離限制工作的執行順序來達到保留目的,因此可使非週期性工作得到較低平均反應時間。 |
英文摘要 | For distance-constrained real-time systems, the difference of the finish times of two conseccutive tasks of a periodic task must be less than or equal to a value called distance. The distance between two consecutive tasks in traditional real time systems with periodic tasks with period p and execution time e could be e (connected tasks) or 2p-e(two ends of the two periods). It may not fit many real-time systems. The aperiodic tasks may have soft deadline and we hope to get a low average response time. Similarly, the sporadic task can be thought as an aperiodic task with a hard deadline and a minimum interarrival time. We study the scheduling of the real-time systems which consists of periodic tasks, aperiodic tasks, and sporadic tasks with distance constraint. Here, we use the two-distinct-integer method to adapt periodic tasks and sporadic tasks with hard deadlines and suggest an algorithm to solve the scheduling of aperiodic tasks. For aperiodic task request, we propose the fixed server, reserved server and sporadic task server in order to increase the execution opportunity of the aperiodic tasks. The server place is obtained by using two- distinct-integer method. As a result, there are some values for periodic tasks, and the extra values are the servers for aperiodic tasks. Following some fixed sequence, the fixed-server scheduling is easy to do by using the extra values. The reserved-server scheduling is more complicated since it may change the execution sequence of the tasks with the same distance constraint. However, it gets a low average response time for aperiodic tasks. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。