Assigning Priorities for Fixed Priority Preemption Threshold Scheduling
Preemption threshold scheduling (PTS) enhances real-time schedulability by controlling preemptiveness of tasks. This benefit of PTS highly depends on a proper algorithm that assigns each task feasible scheduling attributes, which are priority and preemption threshold. Due to the existence of an effi...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2015-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1155/2015/837472 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850237102822785024 |
|---|---|
| author | Saehwa Kim |
| author_facet | Saehwa Kim |
| author_sort | Saehwa Kim |
| collection | DOAJ |
| description | Preemption threshold scheduling (PTS) enhances real-time schedulability by controlling preemptiveness of tasks. This benefit of PTS highly depends on a proper algorithm that assigns each task feasible scheduling attributes, which are priority and preemption threshold. Due to the existence of an efficient optimal preemption threshold assignment algorithm that works with fully assigned priority orderings, we need an optimal priority assignment algorithm for PTS. This paper analyzes the inefficiency or nonoptimality of the previously proposed optimal priority assignment algorithms for PTS. We develop theorems for exhaustively but safely pruning infeasible priority orderings while assigning priorities to tasks for PTS. Based on the developed theorems, we correct the previously proposed optimal priority assignment algorithm for PTS. We also propose a performance improved optimal priority assignment algorithm for PTS proving its optimality. The empirical evaluation results clearly show the effectiveness of the proposed algorithm. |
| format | Article |
| id | doaj-art-1bb4ac520c2c40e5a60f371082e09e85 |
| institution | OA Journals |
| issn | 2356-6140 1537-744X |
| language | English |
| publishDate | 2015-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | The Scientific World Journal |
| spelling | doaj-art-1bb4ac520c2c40e5a60f371082e09e852025-08-20T02:01:50ZengWileyThe Scientific World Journal2356-61401537-744X2015-01-01201510.1155/2015/837472837472Assigning Priorities for Fixed Priority Preemption Threshold SchedulingSaehwa Kim0Department of Information Communications Engineering, Hankuk University of Foreign Studies, Yongin-si, Gyeonggi-do 449-791, Republic of KoreaPreemption threshold scheduling (PTS) enhances real-time schedulability by controlling preemptiveness of tasks. This benefit of PTS highly depends on a proper algorithm that assigns each task feasible scheduling attributes, which are priority and preemption threshold. Due to the existence of an efficient optimal preemption threshold assignment algorithm that works with fully assigned priority orderings, we need an optimal priority assignment algorithm for PTS. This paper analyzes the inefficiency or nonoptimality of the previously proposed optimal priority assignment algorithms for PTS. We develop theorems for exhaustively but safely pruning infeasible priority orderings while assigning priorities to tasks for PTS. Based on the developed theorems, we correct the previously proposed optimal priority assignment algorithm for PTS. We also propose a performance improved optimal priority assignment algorithm for PTS proving its optimality. The empirical evaluation results clearly show the effectiveness of the proposed algorithm.http://dx.doi.org/10.1155/2015/837472 |
| spellingShingle | Saehwa Kim Assigning Priorities for Fixed Priority Preemption Threshold Scheduling The Scientific World Journal |
| title | Assigning Priorities for Fixed Priority Preemption Threshold Scheduling |
| title_full | Assigning Priorities for Fixed Priority Preemption Threshold Scheduling |
| title_fullStr | Assigning Priorities for Fixed Priority Preemption Threshold Scheduling |
| title_full_unstemmed | Assigning Priorities for Fixed Priority Preemption Threshold Scheduling |
| title_short | Assigning Priorities for Fixed Priority Preemption Threshold Scheduling |
| title_sort | assigning priorities for fixed priority preemption threshold scheduling |
| url | http://dx.doi.org/10.1155/2015/837472 |
| work_keys_str_mv | AT saehwakim assigningprioritiesforfixedprioritypreemptionthresholdscheduling |