Chris's Wiki :: blog/programming/GoConcurrencyStillNotEasy
Even in Go, concurrency is still not easy (with an example) Go is famous for making concurrency easy, through good language support for goroutines. Except what Go makes easy is only one level of concurrency, the nuts and bolts level of making your code do things concurrently and communicating back and forth through channels. Making it do the right things concurrently is still up to you, and unfort
RCU(Read Copy Update)をちゃんと知る（1）-1 ほんとの概要 - tkokamoの日記
はじめに ファイルシステムのrcu-walkを理解するためにRCUの勉強から始めようと思ったので書留ます。 RCUとはざっくりこんなものだ、と分かっている前提での記録です。 予想している流れとしては、 概要（概要）← 今回 Linuxでの実装 rcu-walk（RCUの応用先） と考えています。原稿も無いので、次回がいつになるかわかりません（社内勉強会でrcu-walkを語ろうと思っているので完遂はすると思われます） 今回は、wikipediaとかよんでで「？」となった当たりを捕捉。 RCUとは？ 図を用いた簡単な理解 複数のタスクで共有するデータの参照/更新をきちんと行う場合、大抵は適切に排他区間をロックによって設けてそれを実現します。 理想的には、タスク間で共有するデータの参照/更新をロックフリーで行えるとよいのですが、一般的にそのようなことを実現する方法は考えられていません。 しかし
Rob Pike - 'Concurrency Is Not Parallelism'
Rob (@rob_pike) is a software pioneer. His influence is everywhere: Unix, Plan 9 OS, The Unix Programming Environment book, UTF-8, and most recently the Go programming language. Read more at: http://blog.golang.org/concurrency-is-not-parallelism Slides: http://talks.golang.org/2012/waza.slide Original Video by Heroku: https://vimeo.com/49718712 The only reason I re-uploaded this is to be able to
Infer : RacerD | Infer
RacerD finds data races in your Java code. This page gives a more in-depth explanation of how the analysis works, but may be less complete than the Thread Safety Violation bug description page. To run the analysis, you can use plain infer (to run RacerD along with other analyses that are run by default) or infer --racerd-only (to run only RacerD). For example, the command infer --racerd-only -- ja
Google Sites: Sign-in
Not your computer? Use a private browsing window to sign in. Learn more about using Guest mode
Job System 2.0: Lock-Free Work Stealing – Part 1: Basics
Back in 2012, I wrote about the task scheduler implementation in Molecule. Three years have passed since then, and now it’s time to give the old system a long deserved lifting. Requirements for the new job system were the following: The base implementation needs to be simpler. Jobs can be quite stupid on their own, but it should be possible to build high-level algorithms such as e.g. parallel_for
Concurrent Programming for Scalable Web Architectures
Web architectures are an important asset for various large-scale web applications. Being able to handle huge numbers of users concurrently is essential, thus scalability is one of the most important features of these architectures. Multi-core processors, highly distributed backend architectures and new web technologies force us to reconsider approaches for concurrent programming in order to implem
Java Concurrency and Multithreading Tutorial
Java Concurrency is a term that covers multithreading, concurrency and parallelism on the Java platform. That includes the Java concurrency tools, problems and solutions. This Java concurrency tutorial series covers the core concepts of multithreading, concurrency constructs, concurrency problems, costs, benefits related to multithreading in Java. The concurrency and multithreading features in Jav
Concurrency with Actors, Goroutines & Ruby - igvita.com
By Ilya Grigorik on December 02, 2010 The world of concurrent computation is a complicated one. We have to think about the hardware, the runtime, and even choose between half a dozen different models and primitives: fork/wait, threads, shared memory, message passing, semaphores, and transactions just to name a few. Hence, not surprisingly, when Bruce Tate asked Matz, in an interview for his recent
デッカーのアルゴリズム - Wikipedia
デッカーのアルゴリズムはオランダ人数学者 T・J・デッカーの考案した相互排他のためのアルゴリズムである。これにより、共有メモリによる通信のみで、2つのプロセスが1つのリソースを競合することなく共有することができる。 厳密に交互にとっていく素朴なアルゴリズムを避けて発明された世界初の相互排他アルゴリズムの1つである。 ふたつのプロセスが同時に同じクリティカルセクションにアクセスしようとしたとき、このアルゴリズムはどちらのプロセスがアクセス権を得るかを決定する。もしもう一方のプロセスが既にクリティカルセクションに変更を加えていたら、その完了を待つ。 f0 := false f1 := false turn := 0 // or 1 p0: f0 := true p1: f1 := true while f1 = true { while f0 = true { if turn ≠ 0 { if
Visualising an asynchronous monad - Thomas Leonard's blog
Many asynchronous programs make use of promises (also known as using light-weight threads or an asynchronous monad) to manage concurrency. I've been working on tools to collect trace data from such programs and visualise the results, to help with profiling and debugging. The diagram below shows a trace from a Mirage unikernel reading data from disk in a loop. You should be able to pan around by dr
Is Parallel Programming Hard, And, If So, What Can You Do About It?
Is Parallel Programming Hard, And, If So, What Can You Do About It? The current version is v2023.06.11a [PDF] (single-column format [PDF], ebook format [PDF], change log). The default double-column format is easiest on both the trees and the eyes in paperback book form. The single-column format works well on large-format ebook readers. Smartphones and smaller ebook readers get better results with
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Interprocess Locks
How about RLU? Is RLU a generic concurrency control?
Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming | the morning paper
Is RCU a generic concurrency control?
Cats Effect: Concurrency Basics
GitHub - cameron314/concurrentqueue: A fast multi-producer, multi-consumer lock-free concurrent queue for C++11
libdill.org
Communicating Sequential Processes (CSP) An alternative to the actor model