You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.
The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.
For the reports in this repository we specifically note that
- the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
- the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
- technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
- in other cases, please contact the copyright owner for detailed information
By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.
If you are in doubt, feel free to contact webmaster@ide.mdh.se
Adaptive Hierarchical Scheduling Framework for Real-Time Systems
Publication Type:
Licentiate Thesis
Abstract
Modern computer systems are often designed to play a multipurpose role.
Therefore, they are capable of running a number of software tasks (software
programs) simultaneously in parallel. These software tasks should share the
processor such that all of them run and finish their computations as expected.
On the other hand, a number of software tasks have timing requirements meaning
that they should not only access the processing unit, but this access should
also be in a timely manner. Thus, there is a need to timely share the processor
among different software programs (applications). The time-sharing is often
realized by assigning a fixed and predefined processor time-portion to each
application. However, there exists a group of applications where, (i) their processor
demand is changing in a wide range during run-time, and (ii) their occasional
timing violations can be tolerated. For systems that contain applications
with the two aforementioned properties, it is not efficient to assign the applications
with fixed processor time-portions. Because, if we allocate the processor
resource based on the maximum resource demand of the applications, then the
processorÂ’s computing capacity will be wasted during the time intervals where
the applications will require a smaller portion than the maximum resource demand.
To this end, in this thesis we propose adaptive processor time-portion
assignments. In our adaptive scheme, we monitor the actual demand of the applications
during run-time, and we provide sufficient processor time-portions
for each application based on their monitored demand. In doing so, we are
able to integrate more applications on a shared and resource constrained system,
while at the same time providing the applications with timing guarantees.
Bibtex
@misc{Khalilzad2993,
author = {Nima Khalilzad},
title = {Adaptive Hierarchical Scheduling Framework for Real-Time Systems},
month = {June},
year = {2013},
url = {http://www.es.mdu.se/publications/2993-}
}