サクサク読めて、アプリ限定の機能も多数!
トップへ戻る
買ってよかったもの
concurrencyfreaks.blogspot.com
50 years later, is Two-Phase Locking the best we can do? Two phase locking (2PL) was the first of the general-purpose Concurrency Controls to be invented which provided Serializability. In fact, 2PL gives more than Serializability, it gives Opacity, a much stronger isolation level. 2PL was published in 1976, which incidentally is the year I was born, and it is likely that Jim Gray and his buddies
We've talked before about the definition of Lock-Free, but there is a lot of confusion around its definition and the other definitions of Progress Conditions, so lets take a closer look at it. If you google a bit for the definition of Lock-Free, you'll see that there are several: Wikipedia: "An algorithm is lock-free if it satisfies that when the program threads are run sufficiently long at least
As it so happens, object lifetime tracking (or Memory Reclamation as I prefer to call it) is the current most difficult open problem in shared memory concurrency. If you want to design or implement a lock-free or wait-free data structure, the hardest part isn't designing/implementing the data structure itself. The hardest task is to add memory reclamation to this data structure, without reducing t
On the previous post we showed an excellent presentation by Cliff Click, and one of the things he mentions is that there is performance for throughput and performance for latency, which really resonated with me. When people talk about performance, they're usually just interested in throughput. This is fine, but throughput is just one of the vectors of performance, it's just a number (for a particu
このページを最初にブックマークしてみませんか?
『Concurrency Freaks』の新着エントリーを見る
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く