Algorithms
Introduction to algorithms
Experiments with a Program Timing Tool Based on Source-Level Timing Schema
Computer - Special issue on real-time systems
A comparison of sorting algorithms for the connection machine CM-2
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Predicting program execution times by analyzing static and dynamic program paths
Real-Time Systems - Special issue: Real-time languages and language-level timing tools and analysis
An introduction to the analysis of algorithms
An introduction to the analysis of algorithms
Computing Maximum Task Execution Times — A Graph-BasedApproach
Real-Time Systems
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Data Structures and Algorithms
Data Structures and Algorithms
Efficient microarchitecture modeling and path analysis for real-time software
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Important Considerations for Execution time Analysis of Dynamic, Periodic Processes
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
| Hi-index | 0.00 |
In hard real-time systemstasks must meet their deadlines under guarantee. Soft real-timetasks may miss deadlines occasionally, as long as the entiresystem can provide the specified quality of service.In this paper we investigate the hard and soft real-time performanceof sorting algorithms and compare it to their average performance.We show in which way the adequacy of an algorithm depends onthe demanded performance criterium (hard, soft, or non real-time).The results provide a guideline to select the right sorting algorithmfor a given application.