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
Comparison of Priority Queue algorithms for Hierarchical Scheduling Framework: Technical Report, Nr. 2598
Mälardalen University, School of Innovation, Design and Engineering.ORCID iD: 0000-0001-6157-5199
2011 (English)Report (Other academic)
Abstract [en]

The Time Event Queue (TEQ) is a datastructure that is part of the implementation of a Hierarhcial Scheduling Framework (HSF). It's main function is to store future task scheduling events (represented as absolute time values) in a sorted manner, thus, it implements a Priority Queue (PQ). A PQ is a queue with elements that are sorted by their priority. The two main operations on a PQ is insert and delete-min. The first mentioned operation will insert an item based on its priority. The second operation will extract an item with highest (or lowest) priority. As of now, the PQ structure is implemented as a sorted linked list with a median pointer and where binary search is used for insertions. The efficiency of the current implementation is not up to standard so there is a requirement that the current implementation should be replaced or optimized. An investigation should be made so that other PQ implementations are considered that are well suited for hard real-time systems. When choosing a suited PQ for the hard real-time scheduler HSF, considerations such as a low number of queue items in combination with good worst case performance is of importance. This paper will motivate and choose a group of suited PQ algorithms and present empirical tests of each of these algorithms. Based on these results and our requirements, one algorithm will be chosen to be integrated with the HSF.

Place, publisher, year, edition, pages
Västerås: Mälardalen University , 2011.
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:mdh:diva-13598OAI: oai:DiVA.org:mdh-13598DiVA, id: diva2:466141
Available from: 2011-12-15 Created: 2011-12-15 Last updated: 2014-02-04Bibliographically approved

Open Access in DiVA

No full text in DiVA

Authority records BETA

Åsberg, Mikael

Search in DiVA

By author/editor
Åsberg, Mikael
By organisation
School of Innovation, Design and Engineering
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 394 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