mdh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Implementation of the Multi-Level Adaptive Hierarchical Scheduling Framework
Mälardalen University, School of Innovation, Design and Engineering.ORCID iD: 0000-0003-2670-3022
2013 (English)Report (Other academic)
Place, publisher, year, edition, pages
2013.
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:mdh:diva-19013OAI: oai:DiVA.org:mdh-19013DiVA: diva2:621577
Available from: 2013-05-15 Created: 2013-05-15 Last updated: 2014-01-16Bibliographically approved
In thesis
1. Adaptive Hierarchical Scheduling Framework for Real-Time Systems
Open this publication in new window or tab >>Adaptive Hierarchical Scheduling Framework for Real-Time Systems
2013 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

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 often is 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/or 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 maximum resource demand. To this end, in this thesis we propose adaptive processor time-portion assignments. In our adaptive scheme, at each point in time, we monitor the actual demand of the applications, and we provide sufficient processor time-portions for each application. 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.

Place, publisher, year, edition, pages
Västerås: Mälardalen University, 2013
Series
Mälardalen University Press Licentiate Theses, ISSN 1651-9256 ; 167
National Category
Computer Systems
Research subject
Computer Science
Identifiers
urn:nbn:se:mdh:diva-18752 (URN)978-91-7485-111-3 (ISBN)
Presentation
2013-06-13, Lambda, Mälardalens högskola, Västerås, 13:30 (English)
Opponent
Supervisors
Available from: 2013-05-16 Created: 2013-04-19 Last updated: 2013-12-03Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Moghaddami Khalilzad, Nima
By organisation
School of Innovation, Design and Engineering
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

Total: 374 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf