Scheduling Real-Time Multi-Processor Systems with Distance-Constrained Tasks Using the Early-Release-Fair Model(Digital Signal Processing)
スポンサーリンク
概要
- 論文の詳細を見る
A hard real-time system is one whose correctness depends not only on the logical result, but also when the results are produced. While many techniques have been proposed for single processor real-time systems, multiprocessor systems have not been studied so extensively. In this paper, we mainly propose two variant (DCTS) by using the Early-Release-Fair (ERfair) and Proportionate-fair (Pfair) model with integral assumptions for identical multi-processor real-time systems. ERfair is a scheduling model for real-time tasks on a multiprocessor system. On the different definitions of distance constraint, we propose two efficient scheduling algorithms designed to probe whether the distance constraints of all ER-fair tasks can be guaranteed. If the distance constraints cannot be guaranteed, then the proposed algorithms gather the unfeasible tasks and inflate them with a reweighting function. The proposed algorithms are linear-time and most suitable for dynamic systems. The experimental results reveal that the proposed algorithms increase significantly the ratio of schedulable task sets.
- 社団法人電子情報通信学会の論文
- 2006-11-01
著者
-
Hsu Chiun-chieh
Department Of Information Management National Taiwan University Of Science And Technology
-
Wang Chien-min
Institute Of Information Science Academia Sinica
-
Chen Da-ren
Department Of Information Management National Taiwan University Of Science And Technology
-
Chen Da-ren
Department Of Environmental Engineering Science Washington University
関連論文
- IAC2006への招待状
- Using Topic Keyword Clusters for Automatic Document Clustering(Document Clustering, Document Image Understanding and Digital Documents)
- Scheduling Real-Time Multi-Processor Systems with Distance-Constrained Tasks Using the Early-Release-Fair Model(Digital Signal Processing)