Sign Up! | Tags | Domains | Statistics | Options | Advanced Search
|
Sign Up! | Tags | Domains | Statistics | Options | Advanced Search |
microsoft.co.il » All Your Base Are Belong To Us - Oct 26, 2008
Today I finally started the business-related (but still entertaining!) part of my trip - the PDC pre-conference day. I attended the track on concurrent and parallel programming, which was led by Stephen Toub, David …
Also tagged: pdc
microsoft.co.il » All Your Base Are Belong To Us - Aug 18, 2008
Another very simple pattern builds on the foundation of the Safe-Unsafe Cache pattern. What is the easiest way to protect data from multi-threaded access and to incur the minimal performance cost while doing so? Making …
Also tagged: performance
microsoft.co.il » All Your Base Are Belong To Us - Aug 10, 2008
Previously in the series we have examined the performance differences between concurrency patterns based on kernel synchronization (critical sections, events, mutexes etc.) and concurrency patterns based on wait-free …
Also tagged: performance, win32
microsoft.co.il » All Your Base Are Belong To Us - Aug 2, 2008
Last time we have minimized contention by using lock-free operations instead of acquiring a lock on a work item queue (neither a standard lock nor a reader-writer lock offer nearly-linear scaling). On the other hand, a …
Also tagged: performance
microsoft.co.il » All Your Base Are Belong To Us - Jul 30, 2008
In the previous installments we have reviewed multiple strategies for caching or storing calculated key-value data so that accesses to it are optimized to the highest applicable degree. For simpler storage types, such …
Also tagged: performance
microsoft.co.il » All Your Base Are Belong To Us - Jul 11, 2008
After having examined a classical reader-writer-lock-based cache and a thread-local cache, we have come to terms with the deficiencies of both alternatives. A classical RWL-cache requires a lock (albeit a cheap one) …
Also tagged: performance
microsoft.co.il » All Your Base Are Belong To Us - Jul 11, 2008
In the previous post we have looked at the fairly simple implementation of a read-write cache, where elements are created at the moment they are needed. We've also noticed that for the specific cases where the data is …
Also tagged: performance
microsoft.co.il » All Your Base Are Belong To Us - Jul 11, 2008
Assume that you have a set of worker threads producing and consuming information. In the process, there's some generated data that can be cached instead of being calculated every time it is accessed. A typical …
Also tagged: performance
microsoft.co.il » All Your Base Are Belong To Us - Jun 11, 2008
Just a few days ago, the Parallel Extensions team has released a new CTP of the Parallel Extensions for .NET 3.5, a.k.a. PFX. This new CTP is not just a bunch of bug fixes - it's packed with new functionality for us to …
Also tagged: vista, performance, server 2008
microsoft.co.il » All Your Base Are Belong To Us - Jun 11, 2008
In the previous post in this series, we have looked at the new synchronization primitives offered by the PFX June CTP. In this post, we will look at task-related features and at the new task scheduler. Task …
Also tagged: performance