A collection of notes usually about math and software
Wednesday, August 27, 2008
Concurrency Friendly Data Structures
This article describes how linked lists and balanced trees should perform within a concurrent program. To me it sounds like something fundamental that should be learned, but I have avoided doing concurrent programming for quite a while now.
No comments:
Post a Comment