Entries from February 2009 ↓

boost.build unique feature

With boost.build it is possible to integrate different projects with each other. For instance, when you have a project which uses the Boost libraries you can merge both projects by stating use-project boost : /path/to/boost/sources ; in a Jamfile of your project. All build targets of the boost project are then accessible just like any [...]

Privacy- und Sicherheitsaspekte in ubiquitären Umgebungen

A friend of mine, Stefan Schlott, has written his thesis about privacy and security aspects in ubiquitous environments (in German). He tackles the problem of being untraceable although carrying devices with protocol-specific unique identifications and the problem of peering without revealing private data. One of his achievements was the invention of a cryptographic protocol for [...]

C++ headache

In case you are interested I have been making a collection of C++ headache issues on my private blog, during my time as a C++ professional developer.

Boost.Build

Recently I stumbled over Boost.Build which is a build system for C++ projects. Boost.Build is based on FT Jam which in turn is based on Perfoce Jam. I don’t know, which feature has been added by whom. Nevertheless what Boost.Build offers you is really what you ever wanted as a C++ developer.

lock-free dynamic memory allocation

In 2004 Maged M. Michael introduced the first lock-free dynamic memory allocation. According to his benchmarks his implementation outperforms standard memory allocation libraries. For me this is the main advantage of non-blocking synchronization for high-load systems. Simply by avoiding taking locks things speed up considerably. Maged M. Michael released his implementation into open source through [...]

non-blocking synchronization

One of my current fields of interest is non-blocking synchronization. Wikipedia has a good introductive article on this topic. Non-blocking synchronization is of interest for pervasive computing because this technique among other things makes software more robust as it avoids dead-locks and inversions of priority, which are well-known problems of embedded software. As far as [...]