benchmark VS FlameGraph

I'm aware of one by Google that I used a couple times, but IMO it's better to capture real runtime data from a fully-operational process than to carve out the benchmarkable bits and test them in isolation, so I track information during program testing and print it all to a log instead of using things like that.

If you just want to do some quick benchmarks, you can just use std::chrono::high_resolution_clock::now(). Call it before the code that you are benchmarking and then immediately after. Take them away and you have your duration. If you want to use a proper benchmarking tool then I can totally recommend Google Benchmark. Fantastic benchmarking tool. Honourable mention would be Quick Bench which is an online tool that uses Google Benchmark.

I tried to install google benchmark(https://github.com/google/benchmark) in my ubuntu machine by :

We don't know if it's a lie until we verify it and that's not difficult, you have a quicksort implementation in a couple of languages, you'll need to pass the necessary parameters to show the time needed by a function call to execute to the compiler or interpreter or you may use use a library(like benchmark for C++) and you're good to go.

If you are uncertain about the performance characteristics of a function you should ALWAYS benchmark it. Googles Benchmark library is wonderful for quick micro benchmarks. For more complex things, perhaps look into profiling and then look at invocation counts of copy constructors.

Your compiler may be optimising away your loop, there. I typically use a micro-benchmarking tool for these types of tests. You could try Google Benchmark. It’s available in most OS’ package managers, but pretty easy to build from source if not

C++: C++ has quite a number of benchmarking libraries some of the recent ones involving C++ 20's flexibility. The most notable being Google Bench and UT. C does not have many specific benchmarking libraries, but you can easily integrate C code with C++ benchmarking libraries in order to test the performance of your C code.

We'll use async-profiler and flame graphs for profiling. To simplify the process, we'll run the code using JBang.

And flame graphs excel and this kind of thing

https://www.brendangregg.com/flamegraphs.html

which can output in a format understood by Brendan Gregg's flame frames (https://www.brendangregg.com/flamegraphs.html)

But that's not quite the kind of tracing you're talking about. We also built a printf-style interface to our recording files, which seems closer:

Strategies included discontinuing or resizing underutilized services, transitioning to more cost-effective solutions, reducing the current resources to the amount of resources that we need for our application, and conducting detailed analyses of computing resource utilization through tools like flamegraphs. This detailed scrutiny helped identify and rectify significant cost-driving areas, such as garbage collection and application configurations.

Flame Graphs by Brendan Gregg

Historically brendangregg's since AIUI he basically invented flamegraphs

https://www.brendangregg.com/flamegraphs.html

So if you can make your tool eat whatever https://github.com/brendangregg/FlameGraph is fed with you're going to support a lot of existing tooling across OSes and languages.

“Flame graphs are a visualization of hierarchical data, created to visualize stack traces of profiled software so that the most frequent code-paths to be identified quickly and accurately.”

SVGs are amazing for interactive visualisation too. Like Flamegraphs: https://www.brendangregg.com/flamegraphs.html

This may be a good example of the application of a flame graph but it is not a good demonstration of flame graphs; the graph is nearly incidental. The source has an actual explanation.

A profiling flame graph from Graphile Crystal (a precursor to Grafast) using GraphQL.js' executor (each tick is 1ms, total: 29ms). As we removed more and more responsibilities from GraphQL.js, we ended up only using it for output. Replacing this final responsibility with a custom implementation in Graphile Crystal itself, we reduced execution time for this query down to 15.5ms (effectively removing the majority of the yellow portion of the flame graph).