Blog

 

.NET 4.0 - Performance of Task Parallel Library (TPL)

1/19/2010
.NET, C#
3 Comments

The upcoming .NET Framework 4.0 will contain the new Task Parallel Library (TPL). The TPL will be used by PLINQ, which is a parallel implementation of LINQ to Objects.
PLINQ makes it easier to take advantage of today's multicore CPUs, without caring about thread synchronization.
In this post I will do some benchmarks to get an impression of the TPL's performance, compared to current technologies.





ASP.NET - Count feed subscribers without Feedburner

1/8/2010
.NET, ASP.NET, C#
0 Comments

The most important advantage of Feedburner is the subscriber count. But Feedburner is not an option for everyone, since the address of your feed changes if you move it to Feedburner.
You could redirect requests to your feed to the new address, the disadvantage though is that when someone opens the URL in his browser the browser will show the new address.
In this post I will show an approach how you can get a subscriber count, without moving your feed to Feedburner.



VSTO - Speech recognition in Outlook Addin with .NET

1/6/2010
.NET, C#, VSTO
0 Comments

In this article I will show how you could create an Outlook Addin that enables you to enter the recipients of an email by speech.
First we setup the speech recognition engine with the contacts from the address book. Then we listen to the relevant events to start and stop speech recognition automatically.



WPF - Animation of graph algorithms - Part 2

12/29/2009
.NET, C#, WPF
2 Comments

In the first part of this series I showed how to implement a data structure for graphs.
Now let's continue with the UI. The UI should be capable of creating graphs consisting of nodes and edges with some mouse clicks. Moreover it should be easy to execute previously created graph algorithms and to show their animations.



WPF - Animation of graph algorithms - Part 1

12/29/2009
.NET, C#, WPF
1 Comments

A few years ago I had to create some animations of graph algorithms. That meant two things: I had to implement algorithms like Dijkstra or Kruskal and then create a visual representation of the algorithm, so one could see what happens step by step.
The code was written in C++ using LEDA for the graphs data structure and AGD (now called OGDF) for visualization.

In this series I will describe how I implemented a tool for creating graph animations in .NET using WPF. This first part will discuss the underlying data structures. The second part will concentrate on the 3D stuff and the animations.