The deadline-based scheduling of divisible real-time workloads on multiprocessor platforms
Current formal models of real-time workloads were designed within the context of uniprocessor real-time systems; hence, they are often not able to accurately represent salient features of multiprocessor real-time systems. Researchers have recently attempted to overcome this shortcoming by applying w...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 語言: | English |
| 出版: |
2009
|
| 主題: | |
| 在線閱讀: | http://eprints.utm.my/id/eprint/13589/1/SuriayatiChupratPFS2009.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | Current formal models of real-time workloads were designed within the context of uniprocessor real-time systems; hence, they are often not able to accurately represent salient features of multiprocessor real-time systems. Researchers have recently attempted to overcome this shortcoming by applying workload models from Divisible Load Theory (DLT) to real-time systems. The resulting theory, referred to as Real-time Divisible Load Theory (RT-DLT), holds great promise for modeling an emergent class of massively parallel real-time workloads. However, the theory needs strong formal foundations before it can be widely used for the design and analysis of real-time systems. The goal of this thesis is to obtain such formal foundations, by generalizing and extending recent results and concepts from multiprocessor real-time scheduling theory. To achieve this, recent results from traditional multiprocessor scheduling theory were used to provide satisfactory explanations to some apparently anomalous observations that were previously made upon applying DLT to real-time systems. Further generalization of the RT-DLT model was then considered: this generalization assumes that processors become available at different instants of time. Two important problems for this model were solved: determining the minimum number of processors needed to complete a job by its deadline; and determining the earliest completion time for a job upon a given cluster of such processors. For the first problem, an optimal algorithm called MINPROCS was developed to compute the minimum number of processors that ensure each job completes by its deadline. For the second problem, a Linear Programming (LP) based solution called MIN-� was formulated to compute the earliest completion time upon given number of processors. Through formal proofs and extensive simulations both algorithms have been shown to improve the nonoptimal approximate algorithms previously used to solve these problems. |
|---|