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

Comparison of Priority Queue algorithms for Hierarchical Scheduling Framework

Fulltext:


Authors:


Research group:


Publication Type:

Report

Publisher:

Nr. 2598


Abstract

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.

Bibtex

@techreport{Asberg1825,
author = {Mikael {\AA}sberg},
title = {Comparison of Priority Queue algorithms for Hierarchical Scheduling Framework},
month = {October},
year = {2011},
publisher = {Nr. 2598},
url = {http://www.es.mdh.se/publications/1825-}
}