Covers issues to be considered when designing or implementing parallel algorithms.
This chapter gives an overview of how to approach a problem and design a problem in a parallel manner. The chapter starts with an insight into how a problem can be decomposed to solve it in parallel, touching upon aspects of data-dependencies and the measures of parallel algorithms.
The last section deals with specific parallel algorithms
Avoiding Heap Contention Among Threads (PDF 256KB)
Allocating memory from the system heap can be an expensive operation due to a lock used by system runtime libraries to synchronize access to the heap. Contention on this lock can limit the performance benefits from multithreading. To solve this problem, apply an allocation strategy that avoids using shared locks, or use third party heap managers.
It’s Tuesday, January 25, 2011 and this is Parallel Programming Talk
- Casual Connect (Casual Games industry)- Feb 10 – 12 Congress Center, Hamburg, Germany - for casual game developers… Learn more: http://europe.casualconnect.org/
- Page 1