Gain insights into using Modern C++ for embedded programming. Learn about safety-critical systems, optimize performance, manage limited resources, and handle parallel execution effectively.

waleed1.tar.gz

C++11

C++ 17

Embedded Programming with Modern C++  is highly valuable for each professional programmer.

In the past, embedded and system programming have had their pitfalls, but modern C++ has been designed to be a better language for this type of development, addressing the previous pitfalls/requirements explicitly. What are these requirements? Embedded systems deal with safety-critical systems, meaning they must guarantee high performance combined with limited resources, while also working in parallel.

The scope of this course goes beyond just embedded programming. Developers who write servers, games, or trading systems may especially benefit from this course because they also have to deal with safety-critical systems, high performance, reduced resources, and parallel execution in their jobs.

To get the most out of the course, you only need a basic understanding of C++. Building off this understanding, this course goes over all the essentials of embedded programming with Modern C++.

Let's get started!

Embedded Programming with Modern C++

# A Simple Performance Comparison
Before we take a deeper look into associative containers, let’s examine the interface of the hash tables, which are called unordered associative containers. We will first compare the performance of the associative containers.

Admittedly, the eight variations of associative containers can be confusing. In addition, the unordered name component of the new variations is not easy to read or write. On the one hand, the unordered associative containers were too late for the C++98 standard. On the other hand, they were missed so badly that most of the architectures implemented them by themselves. Therefore, the simple names have already been used, and the C++ standardization committee must use more elaborate names, that follow a simple pattern.

The table below shows the entire system. It includes the access time for the ordered containers (logarithmic) and the unordered container (amortized constant).


We can also look at the table from a different perspective. A `std::unordered_set` supports the interface of a `std::set`. The same holds for the pairs `std::unordered_map` and `std::map`, `std::unordered_multiset` as wel as `std::multiset`, `std::unordered_multimap` and `std::multimap` as well. This means, if an `std::map` is too slow, we can quite easily use an `std::unordered_map`.

In this lesson, we will learn about ordered and unordered associative containers.

Introduction

Safety-Critical Systems

High Performance

Reduced Resources

Several Tasks Simultaneously

Conclusion

Associative Containers

A Simple Performance Comparison