Fortsätt till huvudinnehåll

Hey kids! Stay away from POT.

I have been thinking about concurrency and parallelism a bit recently (hard not to when you are taking a course on functional programming and in your daily work develop software targeting a many-core processor). I thought it would be interesting to read up a bit on how to do parallelism in Java. After a bit of searching the net I found this Oracle article by Julien Ponge.

The article starts by describing the usage of Plain Old Threads (POT) and the shortcomings involved in using them. It goes on describing the introduction of the concurrent packages in Java 5 which was later refined in Java 6 and finally introduces fork/join that was added in Java 7.

The article has many examples and a provides a good overview of concurrency and parallelism in Java 7. I would recommend a read through for anyone planning to go beyond single threading in Java.

Me, I am planning to do some benchmarking sorting 1 GB of random ints. Maybe the generation of the ints can be done in parallel as well...

Kommentarer

Skicka en kommentar

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

C# Enum as bit field

Bit field enum Whenever you wish to express combinations of properties of an object, bit fields are a good way to accomplish this. As a simple example, consider a file in the file system. It can be Readable , Writable , Hidden or a combination these. The different attributes can be defined as an enum : [Flags] public enum FileAttribute {   None      = 0b0000;   Readable  = 0b0001;   Writeable = 0b0010;   Hidden    = 0b0100; } To indicate that this enum is expected to be used as a bit field I have defined it with the FlagsAttribute . It is important to understand that the FlagsAttribute does nothing more than making some changes to how the ToString method of the enum works, making it possible to print out all flags. It does not introduce any validation or special treatment of the enum in any other way. I have defined the values of the different fields of the enum using binary representation, this should make it even more clear that this is a bit field and which bi
Skicka en kommentar
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