Which sorting algorithms to choose for hard real-time applications

Proceedings - Euromicro Conference on Real-Time Systems

Volumn , Issue , 1997, Pages 250-257

  Mittermair, D ^a   Puschner, P ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYSIS TOOLS; HARD REAL-TIME; HARD REAL-TIME SYSTEMS; REAL-TIME APPLICATION; SORTING ALGORITHM; WORST-CASE EXECUTION TIME; WORST-CASE PERFORMANCE; WORST-CASE TIME;

ALGORITHMS; EXPERIMENTS; INTERACTIVE COMPUTER SYSTEMS; SORTING;

REAL TIME SYSTEMS;

EID: 71549150186     PISSN: 10683070     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EMWRTS.1997.613792     Document Type: Conference Paper

References (15)

1. G. E. Blelloch, C. E. Leierson, B. M. Maggs, C. G. Plaxton, S. J. Smith, and M. Zagha. A comparison of sorting algorithms for the connection machine cm-2. In Proceedings of the Symposium on Parallel Algorithms and Architectures, pages 3-16, 1991.
2. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press and McGraw Hill, 1990.
3. M. G. Harmon, T. P. Baker, and D. B. Whalley. A retargetable technique for predicting execution time. In Proc. 13th Real-Time Systems Symposium, pages 68-77, Phoenix, AZ, USA, Dec. 1992.
4. R. M. Karp. A survey of parallel algorithms for shared-memory machines. Technical Report CSD-88-408, University of California Berkeley, 1988.
5. D. E. Knuth. The Art of Computer Programming, volume 3. Addison-Wesley, Reading, MA, USA, 1973.
6. Y. s. Li, S. Malik, and A. Wolfe. Efficient microarchitecture modeling and path analysis for real-time software. In Proc. 16th Real-Time Systems Symposium, pages 298-307, Dec. 1995.
7. K. Mehlhorn. Data Structures and Efficient Algorithms, volume 1. Springer, EATCS Monographs, 1984.
8. L. Motus and M. Rodd. Timing Analysis of Real-Time Software. Pergamon, Elsevier Science, 1994.
9. C. Y. Park. Predicting program execution times by analyzing static and dynamic program paths. Real-Time Systems, 5(1):31-62, 1993.
10. C. Y. Park and A. C. Shaw. Experiments with a program timing tool based on source-level timing schema. IEEE Computer, 24(5):48-57, May 1991.
11. P. Puschner and A. Schedl. Computing maximum task execution times - a graph-based approach. Real-Time Systems, to appear 1997.
12. R. Sedgewick. Algorithms. Addison-Wesley, Reading, MA, USA, 1989.
13. R. Sedgewick and P. Fajolet. An Introduction to the Analysis of Algorithms. Addison-Wesley, Reading, MA, USA, 1996.
14. A. C. Shaw. Reasoning about time in higher-level language software. IEEE Transactions on Software Engineering, SE-15(7):875-889, July 1989.
15. J. A. Stankovic. Misconceptions about real-time computing: A serious problem for next-generation systems. IEEE Computer, 21(10):10-19, Oct. 1988.