The .NET Framework 4 introduces the System.Collections.Concurrent namespace, which includes several collection classes that are both thread-safe and scalable. Multiple threads can safely and efficiently add or remove items from these collections, without requiring additional synchronization in user code. When you write new code, use the concurrent collection classes whenever the collection will be writing to multiple threads concurrently. If you are only reading from a shared collection, then you can use the classes in the System.Collections.Generic namespace. We recommend that you do not use 1.0 collection classes unless you are required to target the .NET Framework 1.1 or earlier runtime.
The collections introduced in the .NET Framework 1.0 are found in the System.Collections namespace. These collections, which include the commonly used ArrayList and Hashtable, provide some thread-safety through the Synchronized property, which returns a thread-safe wrapper around the collection. The wrapper works by locking the entire collection on every add or remove operation. Therefore, each thread that is attempting to access the collection must wait for its turn to take the one lock. This is not scalable and can cause significant performance degradation for large collections. Also, the design is not completely protected from race conditions. For more information, see Synchronization in Generic Collections on the MSDN Web site.
The collection classes introduced in the .NET Framework 2.0 are found in the System.Collections.Generic namespace. These include List<T>, Dictionary<TKey, TValue>, and so on. These classes provide improved type safety and performance compared to the .NET Framework 1.0 classes. However, the .NET Framework 2.0 collection classes do not provide any thread synchronization; user code must provide all synchronization when items are added or removed on multiple threads concurrently.
We recommend the concurrent collections classes in the .NET Framework 4 because they provide not only the type safety of the .NET Framework 2.0 collection classes, but also more efficient and more complete thread safety than the .NET Framework 1.0 collections provide.
Some of the concurrent collection types use lightweight synchronization mechanisms such as SpinLock, SpinWait, SemaphoreSlim, and CountdownEvent, which are new in the .NET Framework 4. These synchronization types typically use busy spinning for brief periods before they put the thread into a true Wait state. When wait times are expected to be very short, spinning is far less computationally expensive than waiting, which involves an expensive kernel transition. For collection classes that use spinning, this efficiency means that multiple threads can add and remove items at a very high rate. For more information about spinning vs. blocking, see SpinLock and SpinWait.
Because the concurrent collections classes support ICollection, they provide implementations for the IsSynchronized and SyncRoot properties, even though these properties are irrelevant. IsSynchronized always returns false and SyncRoot is always null (Nothing in Visual Basic).
The following table lists the collection types in the System.Collections.Concurrent namespace.
Thread-safe implementation of a dictionary of key-value pairs.
Thread-safe implementation of a FIFO (first-in, first-out) queue.
Thread-safe implementation of a LIFO (last-in, first-out) stack.
Thread-safe implementation of an unordered collection of elements.
The interface that a type must implement to be used in a BlockingCollection.
Describes the functionality provided by the BlockingCollection<T> type.
Describes how to add and remove elements from a ConcurrentDictionary<TKey, TValue>
Describes how to add and retrieve items from a blocking collection without using the read-only enumerator.
Describes how to use any collection class as the underlying storage mechanism for an IProducerConsumerCollection<T> collection.
Describes how to use foreach, (For Each in Visual Basic) to remove all items in a blocking collection.
Describes how to use multiple blocking collections at the same time to implement a pipeline.
Shows how to use a concurrent bag to improve performance in scenarios where you can reuse objects instead of continually creating new ones.