Fortsätt till huvudinnehåll

Coding Dojo for smart memory usage

The target hardware that I develop for at work have several types of memory. Some are fast, but extremely limited, others are large but not that fast. As a developer for that architecture it is very important to make wise choices when it comes to how to use the different types of memory (no tools are available for helping out, it is all up to the developer).

Several new developers with limited or no experience of developing under these cirumstances have recently joined us. In order to help them understand the impact different memory usage can have I have started to prepare material for a Coding Dojo which will start off with a non-optimal memory model and by applying some simple patterns they should be able to optimize the performance by several hundered percent.

Looking forward to sharing my knowledge. We all should, as much as possible.

Kommentarer

  1. Petter22 april 2016 kl. 04:12

    Kul! Vore kul att ta del av det, men det kanske blir arbetsgivarens material... Kanske kan få en privat dojo hemma hos dig (kanske med en god tårta till ;) )

    SvaraRadera
    Svar
    1. Eric Bäckhage24 april 2016 kl. 13:21

      Nu är jag säker på att mina kommentarer försvinner när jag skriver in dem via mobilen. Andra gången jag svarar dig nu.
      Just den här Dojon blir väldigt specifik för denna arkitektur, men vi har en annan som funkar på vilken dator som helst med en hyfsat modern C++ kompilator. Nu får vi säkert inte sprida materialet ändå men det går ju att inspireras av den.

      Radera
    2. Petter26 april 2016 kl. 06:24

      Får ha en hemlig privat dojo då :)

      Radera

Skicka en kommentar

Populära inlägg i den här bloggen

Does TDD really improve software quality?

I have asked myself this question several times, and searched for answers, without coming up with any clear answer. Therefore I have decided to go hard core TDD for a longer period of time (at least 6 months) to really evaluate the effects. There are several things that I find confusing when it comes to TDD. One example is what actually defines a unit test. What is a "unit" anyway? After reading a bit about it I found a text claiming that the "unit" is "a unit of work", i.e. something quite small. Like converting a string to UPPERCASE or splitting a string into an ['a','r', 'r', 'a', 'y'] of chars. This work is usually performed by a single call to a single method in a single, isolated, class. So, what does it mean that a class is isolated? Does it mean that it doesn't have any dependencies to other classes? NO! In the context of TDD it means that any dependencies are supplied by the test environment, for exa...
3 kommentarer
Läs mer

Codility tasks - Part I

I was recently faced with two codility tasks when applying for a job as an Embedded Software Engineer. For those of you who arn't familiar with Codility you can check out their website here:  www.codility.com Task one - Dominator The first task was called Dominator. The goal was to, given a std::vector of integers, find an integer that occurs in more than half of the positions in the vector. If no dominator was found -1 should be returned. My approach was to loop through the vector from the first to the last element, using a std::map to count the number of occurences of each integer. If the count ever reached above half the size of the vector I stopped and returned that integer and if I reached the end without finding a dominator I returned -1. So was that a good approach? Well, the reviewer at the company rated the solution as 'pretty ok'. His preferred solution was store the first integer in the array and set a counter to 1. Then loop through the remaining i...
7 kommentarer
Läs mer

Been reading up on Dijkstra's search algorithm

Last weeks have been a bit slow on the algorithm front. Still on it though. I have been solving some Graph challenges on  www.hackerrank.com  and reading several different texts on Dijkstra's search algorithm. It seems like this is an algorithm that is a bit tough to understand and implement in a correct and efficient way. Dijkstra's algorithm can be used on graphs with weighted edges, i.e. different paths have different costs. As long as the weights have positive values Dijkstra's algorithm should work fine. The procedure is quite similar to Breadth First Search, the difference here being that the total edge weight can be less even when more edges are involved. It is therefore necessary to keep track of the current total, and if a shorter path is found, update the total and the parent node (can be used for printing the vertices visited when traveling the shortest distance from vertex v1 to vertex v2). Dijkstra's algorithm is also greedy, in the sense that it visi...
Skicka en kommentar
Läs mer