Skip to main content

Project Stage 3

Photo by NASA on Unsplash

Hello! In this post, I’ll make a list of optimization opportunities that I identified on the AWK project based on what I’ve learned in the SPO600 classes. There are two types of optimizations: portable and platform-specific.

Portable optimizations are the ones that work everywhere, like better algorithms and implementations, and also compiler building flags.
Platform-specific, on the other hand, works only for a targeted architecture. Like the SIMD instructions available only on Arch64 and many others specific for x86_64. It is possible to “force” the usage of such instructions according to the targeted hardware. We can do that on compilation time, and also on run-time.

Now that we know our options, let’s dig in. According to my previous post, the functions nematch and readrec are the hotspots. Here is the command line used to run the awk:

./awk 'BEGIN {FS = "<|:|=";} {if ($8 == "DDD>") a ++;} END {print "count: " a;}' bmark-data.txt

The nematch function is designed to match the regular expression informed in the command line with the characters of each line of the file bmark-data.txt. We have an opportunity here. We could change the regex algorithm for a better one. The same applies to the readrec function, which is designed to read the bmark-data.txt. If we could find faster algorithms, it would make a significant improvement. 

It seems that the awk is not multithreading. It would be great to have a flag or so to spawn multiple processes to deal with a heavy load. In my experience, there is always gain doing things in parallel. That is valid for nametch and readrec, and its parents refldbld and getrec.

All the suggestions above are portable. Also, there are some platform-specific that it would help as well.

I don’t know if it is possible to implement due to the uncertainty of the input (regex and data file). Still, I would try to implement SIMD as low-level parallelization. Instead of processing one by one, making two or four each time would improve the performance drastically. Here, I think that the refldbld and getrec are good candidates for vectorization too.

Also, we could search for applicable platform-specific optimizations that the GCC compiler is not applying, so we can rewrite the code to make it easy for the compiler.

I didn’t find any hardware-specific optimization in the awk project. That might be a clue that there is space for such improvement, not only for Arch64 but also for x86_64. I recognize that this path is hard and requires a lot of knowledge of the hardware and its instructions. Hopefully, the community can help with that.

Finally, playing with the compiler optimization flags can produce excellent results, as demonstrated in Project Stage 1. It doesn’t require changing the code, but definitely, it needs testing.

So, here is the list of my suggestions:

1 – Replace regular expressions algorithm on nametch;
2 – Replace read text file algorithm on readrec;
3 – Implement parallelism on nametch, readrec, refldbld and getrec;
4 – Restructure the code to facilitate SIMD and other hardware-specific optimizations;
5 – There are no platform-specific optimizations, so check everywhere, starting from nametch and readrec;
6 - Try out compiler optimization flags;

This is my last post. We’ve reached the end of the SPO600 course. It was a bumpy journey into assembly language, instructions, bits and bytes, but I liked it. It gave me more details on the software’s lowest level. Even being an upper-level developer (Java, C++, Typescript, PLSQL), I’ll store all knowledge acquired on SPO600 in a special place in my toolbox. Thank you, Chris, all the best.

Comments

Popular posts from this blog

Two-digit Numeric Display - Final

Photo by  Nick Hillier  on  Unsplash In this post, I’ll continue the two-digit numeric display. If you miss it, click here and check it out . To finish this project, we just need to show the numbers in the matrix-pixel (the black-box in the 6502 emulator ). To kickstart, our instructor gave us one example of how to display graphs, which was a lot helpful. The first thing that I’ve noticed was the bitmap table at the bottom. So, I mimic it and made ten tables like that to represent each number (zero to nine). So far, so good! Then I grabbed the logic to display one digit, and then my nightmares just started. How to place two graphs (one for each digit)? How to switch from one number to another? How to reuse code? Where is my coffee?! To emulate some if-elseif-else statements, I used jmp (jump). They are all over the place! However, the 6502 limits the jump range from -127 to 128. That means moving the code-blocks to satisfy all jumps limit. For example, the “m

Project Stage 1

Photo by  SpaceX  on  Unsplash Hello! This is my SPO 600 blog, and this post will be long – sorry. The goal is to pick one project that is CPU intensive, written in C or C++, and experiment different compiler options and present the results. That’s why it will be long – lots of data to show. I choose the AWK project ( https://github.com/onetrueawk/awk ). It is a handy tool to process files. Parse, sort, and filter are some trivial operations that are CPU intensive. To make it harder, I created a huge XML file to parse it and count the tags. I've described the machines in my last post, if you miss it, here it is . I also created a script to run and collect the data. I planned to run each candidate 10 times, but a few attempts didn’t receive any data. So, I decided to nest the loop in a way that even if someone kills my process, the data could be used. Guess what? It happened! To produce the candidates, I just changed the CFLAGS inside the makefile and ran the make comm

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