Journal ArticleDOI
Real-Time Performance of Sorting Algorithms
Reads0
Chats0
TLDR
The results provide a guideline to select the right sorting algorithm for a given application and show in which way the adequacy of an algorithm depends on the demanded performance criterium (hard, soft, or non real-time).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.read more
Citations
More filters
Journal ArticleDOI
Estimating WCET using prediction models to compute fitness function of a genetic algorithm
TL;DR: The results obtained on the four benchmarks Bubble sort, Insertion Sort, Gnome sort and Shaker sorts indicate that the proposed use of prediction models can significantly reduce the temporal verification time.
Book
Fast, Efficient and Predictable Memory Accesses: Optimization Algorithms for Memory Architecture Aware Compilation
Lars Wehmeyer,Peter Marwedel +1 more
TL;DR: This Work focused on the development of a model for memory optimization of the Register File using the encc Compiler Framework, which was developed with the aim of simplifying the design of the registers.
Robustness versus Performance in Sorting and Tournament Algorithms
TL;DR: This paper analyzes the robustness of sorting and tournament algorithms against faulty comparisons and proposes a new tournament algorithm named Iterated Knockout Sy stems which is less exact but more efficient than the Swiss Systems.
Proceedings ArticleDOI
Important considerations for execution time analysis of dynamic, periodic processes
Yongjun Zhou,Lonnie R. Welch,Eui-Nam Huh,C. Alexander,Douglas A. Lawrence,S. Mehta,Charles Cavanaugh +6 more
TL;DR: This paper presents an empirical and space-efficient way to predict the execution time of the dynamic real-time system through a combination of static system profiling and dynamic prediction.
Journal ArticleDOI
Adjusting WiMAX for a Dedicated Surveillance Network
TL;DR: This paper proposes WiMAX adjustment to transform a multi-purpose WiMAX network into a network dedicated to video surveillance, and NS-2 simulations show that the proposed adjustment is able to deliver low delay and high quality video surveillance.
References
More filters
Book
Introduction to Algorithms
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
Book
The Art of Computer Programming
TL;DR: The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
Book
Data Structures and Algorithms
TL;DR: The basis of this book is the material contained in the first six chapters of the earlier work, The Design and Analysis of Computer Algorithms, and has added material on algorithms for external storage and memory management.
Book
Probability and statistics
TL;DR: In this paper, the authors define the notion of conditional probability as the probability of a union of events with respect to a given set of variables, and define a set of classes of variables.