Skip to main content

Benchmarking

Photo by Alex manlyx on Unsplash

Time to get the hands dirty and do some benchmarking. The goal of Lab6 is to run the different sound volume algorithms described in my last post in the five different machines and compare them.
I talked about the algorithm in the last post, so now it’s time to talk about the machines. Here they are:


AARCHIE
BBETTY
CCHARLIE
ISRAEL
XERXES
OS
Fedora 28
Fedora 31
Fedora 30
Ubuntu 19.04
Fedora 30
Architecture
aarch64
aarch64
aarch64
aarch64
x86_64
CPU(s)
24
8
8
16
8
Thread(s) per core
1
1
1
1
2
Model name
Cortex-A53
Cortex-A57
X-Gene
Cortex-A72
Intel(R) Xeon(R) CPU E5-1630 v4 @ 3.70GHz
L1d cache
32K
-
unknown
32K
32K
L1i cache
32K
-
unknown
48K
32K
L2 cache
256K
-
unknown
1024K
256K
L3 cache
4096K
-
-
-
10240K

Before running anything, we need to make sure to get the time consumed by the algorithm only. So, I’ve to change the code provided to get the initial and final dates at the right time, do the elapsed time math and display it. Here is an example.


To get more accurate data possible, I choose to run each one 100 times. I also put a delay of 5 minutes between executions. Then I set to run around 10 pm to collect the data in the next morning. With the data, I extracted the average elapsed time, along with the fastest and slowest. Here is my script to do the hard work for me.



Here are the results (numbers in milliseconds):



AARCHIE
BBETTY
CCHARLIE
ISRAEL
XERXES
Multiplication Method
Min
7571.00
933.00
1715.00
1455.00
340.00
Max
11548.00
942.00
1722.00
1456.00
394.00
Avg
7622.43
934.68
1716.26
1455.53
353.02
Lookup Table Method
Min
12732.00
1376.00
2220.00
2558.00
268.00
Max
34445.00
1390.00
2574.00
2591.00
348.00
Avg
13083.50
1379.64
2406.17
2572.67
281.33
Binary Math Method
Min
4079.00
782.00
1231.00
503.00
211.00
Max
4442.00
795.00
1237.00
505.00
254.00
Avg
4101.68
782.91
1232.35
503.02
218.30

We can see a difference between the algorithms. The binary math method is faster on all platforms. The surprise here is that the multiplication method performs better in aarch64 than in x86_64. And the lookup the opposite, performing better in the x86_64 than in the aarch64. However, we can't compare between machines due to incompatibility. See you!

Comments

Popular posts from this blog

Project Stage 2

Photo by  SpaceX  on  Unsplash Hey! Were you curious about the results of profiling AWK ? Me too! Quick recap, what is profiling, and how to do it? Profiling is a technique to map the time execution of each part of the application. We can add instrumentation to the executable, or use interruption sampling to generate that map. Here, I’ll use both. Click here for more details on profiling . For the instrumentation, we have to tell the compiler to add the tools needed to collect the execution data. So, I’ve changed the “makefile” file, CFLAGS variable with “-g -Og -pg” and ran the make command. Then, I just ran the awk the same way I did to benchmark it. Here is the command line: ./awk 'BEGIN {FS = "<|:|=";} {if ($8 == "DDD>") a ++;} END {print "count: " a;}' bmark-data.txt This awk version, instrumented, generates a file gmon.out, which contains all execution data. This is the raw material to create a profile report using gp

Assembly?

Photo by  Jonas Svidras  on  Unsplash Last week on my SPO course, I had my first experience writing Assembly code. I won’t lie; it was struggling. For me, Assembly is like the Latin of the codding languages and “carpe diem” wasn’t my first lesson. Hexadecimal, binary and a list of instructions is a must know to guarantee survival. Our instructor introduced us to the 6502 processor: it is an old school chip that was used in many home solutions such as PCs and video games. Internally, it has three general-purpose registers, three special-purpose registers, memory and input and output ports. Fortunately, there are emulators on the internet that helps us to focus on the development, hiding the electronic part from us. http://6502.cdot.systems/ Using the emulator, our first task was to copy, paste and execute a piece of code to change the colour of every pixel in the display matrix. That was easy! The result was a yellow screen. Then we were asked to introduce so

Two-digit Numeric Display

Photo by  Nick Hillier  on  Unsplash Hi! I'm continuing my blog about my SPO classes. After a brief introduction in Assembly, we are good to hit Lab3. Our instructor kindly let us choose one project out of five. And of course, we decided to go with the easiest! We had to do a two-digit numeric display where the numbers are incremented or decremented by pressing plus and minus key in the keyboard. Soon the challenges were reviled as we dive into how to code it. Should we treat every digit separated or together? How to print them into the display? After a moment of reflection, we decided to handle the digits independently to facilitate the printing display. Also, we had to add a bit-map representation of the numbers because the 6502 chip doesn’t know any font. In this post, I’ll show you the code with the logic to increment and decrement without displaying anything. You can monitor the address $13 and $14 to make sure that it is working. Let me expla