Resource reclaiming in a uni-processor real time system
This dissertation examines a fundamental problem in the theory of real-time scheduling. Real-time scheduling of a set of aperiodic task with soft deadlines on a uni-processor without preemption and without inserted idle time was investigated. Idle gap as a results of the difference between estimated...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/13308 |
| Summary: | This dissertation examines a fundamental problem in the theory of real-time scheduling. Real-time scheduling of a set of aperiodic task with soft deadlines on a uni-processor without preemption and without inserted idle time was investigated. Idle gap as a results of the difference between estimated computation time and actual computation time was reclaimed to run the scheduler. Introduction of this scheduling approach will increase the CPU utilization and maximizing the deadline hit ratio. |
|---|