Real-Time Performance of Sorting Algorithms

In hard real-time systems tasks must meet their deadlines under guarantee. Soft real-time tasks may miss deadlines occasionally, as long as the entire system can provide the specified quality of service.In this paper we investigate the hard and soft real-time performance of sorting algorithms and co...

Full description

Saved in:
Bibliographic Details
Published inReal-time systems Vol. 16; no. 1; pp. 63 - 79
Main Author Puschner, Peter P
Format Journal Article
LanguageEnglish
Published New York Springer Nature B.V 01.01.1999
Subjects
Adequacy
Algorithms
Classification
Real time
Sorting algorithms
Online AccessGet full text

Cover

More Information
Summary:In hard real-time systems tasks must meet their deadlines under guarantee. Soft real-time tasks may miss deadlines occasionally, as long as the entire system can provide the specified quality of service.In this paper we investigate the hard and soft real-time performance of sorting algorithms and compare it to their average performance. We show in which way the adequacy of an algorithm depends on the demanded performance criterium (hard, soft, or non real-time). The results provide a guideline to select the right sorting algorithm for a given application.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0922-6443
1573-1383
DOI:10.1023/A:1008055919262