11/1997 : Real-Time Performance of Sorting Algorithms

RR Number

11/1997

Conference

Journal of Real-Time Systems, Volume 16, Number 1, p. 63-79, January 1999

Author(s)

Abstract

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.

Bibtex

@article{Puschner:JRTS1999,
  author =       "Peter Puschner",
  title =        "Real-Time Performance of Sorting Algorithms",
  journal =      "Journal of Real-Time Systems",
  year =         "1999",
  volume =     "16",
  number =      "1",
  month =        "Jan.",
  pages =     "63-79"
}

Download

Get rr-11-1997.pdf - Adobe PDF-format, (224.07 KB; posted at November 06 2001)