Real-Time Performance of Sorting Algorithms

Real-Time Systems

Volumn 16, Issue 1, 1999, Pages 63-79

  Puschner, Peter P ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Algorithms; Performance; Real time systems; Sorting; Timing analysis; Worst case execution time

Indexed keywords

ALGORITHMS; COMPUTER SYSTEMS PROGRAMMING; RESPONSE TIME (COMPUTER SYSTEMS); SORTING;

HARD REAL TIME SYSTEMS; SOFT REAL TIME SYSTEMS; SORTING ALGORITHMS;

REAL TIME SYSTEMS;

EID: 0032677708     PISSN: 09226443     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008055919262     Document Type: Article

References (15)

1. Aho, A., Hopcroft, J., and Ullman, J. 1983. Data Structures and Algorithms. Reading, MA: Addison-Wesley.
2. Blelloch, G. E., Leiserson, C. E., Maggs, B. M., Plaxton, C. G., Smith, S. J., and Zagha, M. 1991. A comparison of sorting algorithms for the connection machine cm-2. Proceedings of the Symposium on Parallel Algorithms and Architectures, pp. 3-16.
3. Cormen, T. H., Leiserson, C. E., and Rivest, R. L. 1990. Introduction to Algorithms. MIT Press and McGraw Hill.
4. DeGroot, M. H. 1986. Probability and Statistics. Reading, MA: Addision-Wesley.
5. Harmon, M. G., Baker, T. P., and Whalley, D. B. Dec. 1992. A retargetable technique for predicting execution time. Proc. 13th Real-Time Systems Symposium, Phoenix, AZ, USA, pp. 68-77.
6. Karp, R. M. 1988. A survey of parallel algorithms for shared-memory machines. Technical Report CSD-88-408, University of California Berkeley.
7. Knuth, D. E. 1973. The Art of Computer Programming, volume 3. Reading, MA, USA: Addison-Wesley.
8. Li, Y. S., Malik, S., and Wolfe, A. Dec. 1995. Efficient microarchitecture modeling and path analysis for real-time software. Proc. 16th Real-Time Systems Symposium, pp. 298-307.
9. Mehlhorn, K. 1984. Data Structures and Efficient Algorithms, volume 1. Springer, EATCS Monographs.
10. Park, C. Y. 1993. Predicting program execution times by analyzing static and dynamic program paths. Real-Time Systems 5(1): 31-62.
11. Park, C. Y. and Shaw, A. C. May 1991. Experiments with a program timing tool based on source-level timing schema. IEEE Computer 24(5): 48-57.
12. Puschner, P. and Schedl, A. July 1997. Computing maximum task execution times - a graph-based approach. Real-Time Systems 13(1): 67-91
13. Sedgewick, R. 1989. Algorithms. Reading, MA, USA: Addison-Wesley.
14. Sedgewick, R., and Fajolet, P. 1996. An Introduction to the Analysis of Algorithms. Reading, MA, USA: Addison-Wesley
15. Wolfram Research Inc. 1992. Mathematica. Wolfram Research, Inc., Champaign, Illinois, Version 2.1 edition.