GitHub - Netflix/concurrency-limits
When thinking of service availability operators traditionally think in terms of RPS (requests per second). Stress tests are normally performed to determine the RPS at which point the service tips over. RPS limits are then set somewhere below this tipping point (say 75% of this value) and enforced via a token bucket. However, in large distributed systems that auto-scale this value quickly goes out
Philly ETE Screencast #7 – Doug Lea – Engineering Concurrent Library Components
From Doug Lea’s abstract: “Creating components based on concurrent and parallel algorithms and data structures often requires more attention to “engineering†issues not seen with most other libraries. Components created in the “obvious†way sometimes turn out to be wrong, to perform poorly, or are unusable in most applications, because the abstractions in which they are expressed are leaky, imprec
Go Concurrency Patterns
Go Concurrency Patterns Rob Pike Google Video This talk was presented at Google I/O in June 2012. Watch the talk on YouTube 2 Introduction 3 Concurrency features in Go People seemed fascinated by the concurrency features of Go when the language was first announced. Questions: Why is concurrency supported? What is concurrency, anyway? Where does the idea come from? What is it good for? How do I use
Non-blocking STMã«ã¤ã„ã¦é ‘å¼µã£ã¦èª¬æ˜Žã—ã¦ã¿ã‚‹ - ãã¾ãƒ¡ãƒ¢
STMã¯ã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ãƒˆãƒ©ãƒ³ã‚¶ã‚¯ã‚·ãƒ§ãƒŠãƒ«ãƒ¡ãƒ¢ãƒªã®ç•¥ã§ã™ã€‚ ↓ã¨ã‚Šã‚ãˆãšwikipedia http://ja.wikipedia.org/wiki/%E3%82%BD%E3%83%95%E3%83%88%E3%82%A6%E3%82%A7%E3%82%A2%E3%83%88%E3%83%A9%E3%83%B3%E3%82%B6%E3%82%AF%E3%82%B7%E3%83%A7%E3%83%8A%E3%83%AB%E3%83%A1%E3%83%A2%E3%83%AA 日本ã§STMã®è©±é¡Œã‚’検索ã™ã‚‹ã¨ã€Œæ¥½è¦³çš„ãƒãƒƒã‚¯ã§ã—ょ？ã€ã¨ã„ã£ãŸç™ºè¨€ã‚’見ã‹ã‘る事ãŒå¤šãã€ç¢ºã‹ã«å®Ÿç”¨çš„ãªæ‰‹æ³•ã®å¤šãã¯ãƒãƒƒã‚¯ãƒ™ãƒ¼ã‚¹ã ã£ãŸã‚Šã—ã¦ã„ã¾ã™ãŒã€æ£ç›´ãªã¨ã“ã‚ãƒãƒƒã‚¯ãƒ™ãƒ¼ã‚¹ãªæ‰‹æ³•ã®STMã¯ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ã§ã®ãƒˆãƒ©ãƒ³ã‚¶ã‚¯ã‚·ãƒ§ãƒ³ã¨ä¼¼ã¦ã„るフシãŒã‚ã£ãŸã‚Šã—ã¦ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ã«è©³ã—ã„人ã‹ã‚‰ã™ã‚‹ã¨ãã‚Œã»ã©é©šãよã†ãªæ‰‹æ³•ã§ã¯ãªã„事ãŒå¤šã„ã®ã§ã™ã€‚ãã®
ã§ãã‚‹ï¼ä¸¦åˆ—・並行プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°
ç¾åœ¨ã®ãƒžãƒ«ãƒã‚¹ãƒ¬ãƒƒãƒ‰ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®æŠ±ãˆã‚‹å•é¡Œç‚¹ã¨ã€ä»£æ›¿æ¡ˆã‚’ã‚ã‹ã‚Šã‚„ã™ã解説ã„ãŸã—ã¾ã™ã€‚æœ€è¿‘ç™»å ´ã—ãŸConcurrent Revisionsも解説ã—ã¾ã™ã€‚Read less
冬ã®Lock freeç¥ã‚Š safe
19. What is Blocking? コアãŒå¢—ãˆã‚‹ã»ã©ã«å•é¡ŒãŒé¡•è‘—ã«ï¼ æ—©ãã—ã‚よ… æ—©ãã—ã‚よ… æ—©ãã—ã‚よ… æ—©ãã—ã‚よ… æ—©ãã—ã‚よ… æ—©ãã—ã‚よ… æ—©ãã—ã‚よ… æ—©ãã—ã‚よ… æ—©ãã—ã‚よ… クリティカルセク ション
The LMAX Architecture
LMAX is a new retail financial trading platform. As a result it has to process many trades with low latency. The system is built on the JVM platform and centers on a Business Logic Processor that can handle 6 million orders per second on a single thread. The Business Logic Processor runs entirely in-memory using event sourcing. The Business Logic Processor is surrounded by Disruptors - a concurren
モダン並列・並行プãƒã‚°ãƒ©ãƒŸãƒ³ã‚° ～ Concurrent Revisions ã«ã‚ˆã‚‹å®Ÿè£…ã¨ç¾å®Ÿ ～ - Preferred Networks Research & Development
本日社内å‘ã‘ã®TechTalkã«ã¦ã€ä¸¦åˆ—・並行プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã«é–¢ã™ã‚‹è©±ã‚’è¡Œã„ã¾ã—ãŸã€‚ 昨今ã€ãƒ—ãƒã‚°ãƒ©ãƒ ã®ä¸¦åˆ—化ã¯ãªãã¦ã¯ãªã‚‰ãªã„ã‚‚ã®ã¨ãªã£ã¦ã„ã¾ã™ã€‚ã—ã‹ã—ã€ãã®ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ç’°å¢ƒã¯ä¾ç„¶ã¨ã—ã¦ãƒãƒƒã‚¯ã‚’用ã„ãŸã‚‚ã®ãŒä¸»æµã§ã™ã€‚今回ã®ç™ºè¡¨ã®ä¸»å¼µã‚’端的ã«ç”³ã—上ã’ã¾ã™ã¨ã€ “Locks must goï¼â€ ã¨ã„ã†ã“ã¨ã«ãªã‚Šã¾ã™ã€‚並列プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã«éŠ€ã®å¼¾ä¸¸ã¯ã‚ã‚Šã¾ã›ã‚“。ã—ã‹ã—ã€ãƒãƒƒã‚¯ã¯åˆ¥ã®ä½•ã‚‰ã‹ã®å®‰å…¨æ€§ã‚’確ä¿ã—ãŸãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ãƒ¢ãƒ‡ãƒ«ã§ç½®ãæ›ãˆã‚‰ã‚Œãªã‘ã‚Œã°ã„ã‘ã¾ã›ã‚“。ãã†ã§ãªã‘ã‚Œã°ã€å†ç¾ã—ã«ãã„ãƒã‚°ã«è‹¦ã—ã‚られã€çµ‚電を逃ã™æ—¥ã€…ã¨æ±ºåˆ¥ã™ã‚‹ã“ã¨ã¯ã§ããªã„ã§ã—ょã†ã€‚ã¾ãŸã€ãƒãƒƒã‚¯ã«ã‚ˆã‚‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®æŠ±ãˆã‚‹æœ¬è³ªçš„å•é¡Œã«ã‚‚言åŠã—ã¦ã„ã¾ã™ã€‚ ã“ã®ç•Œéšˆã®æœ€æ–°ã®å‹•å‘ã¨ã—ã¦ã€åŽ»å¹´OOPSLA’10ã«ã¦ç™ºè¡¨ã•ã‚ŒãŸConcurrent Revisionsã«ã¤ã„ã¦ã®è§£èª¬ã‚‚è¡Œãªã£ã¦ãŠã‚Šã¾ã™ã€‚ã¾ãŸã€å¼Šç¤¾ç ”究開発ã«ãŠã„ã¦ã€å…ˆæ—¥Con
Threads without Locks
Russ Cox http://swtch.com/~rsc/talks/ Second International Plan 9 Workshop December 2007 Introduction Two popular camps for designing concurrent programs. Threads with locks Birrell, “An introduction to programming with threads†Top-level select loops with events Ousterhout, “Why threads are a bad idea (for most purposes)†Should we use threads or events? Andrew Birrell: threads. John Ousterhout:
Assessing concurrency models - Bertrand Meyer's technology+ blog
Software engineering, programming methodology, languages, verification, general technology, publication culture, and more By describing a poorly conceived hypothetical experiment, last week’s article described the “Professor Smith syndrome†consisting of four risks that threaten the validity of empirical software engineering experiments relying on students in a course: Professor Smith Risk 1: pos
Concurrent programming is easy - Bertrand Meyer's technology+ blog
Software engineering, programming methodology, languages, verification, general technology, publication culture, and more EiffelStudio 6.8, released last month, contains the first official implementation of the SCOOP programming model for concurrent programming. This is an important milestone; let me try to explain why. Concurrency challenging us Concurrency is the principal stumbling block in the
Lock-Free Algorithm, CriticalSection, IHostCrst - NyaRuRuãŒåœ°çƒã«ã„ãŸã“ã‚
スレッド化ã§ã€Œæ™®é€šã¯ã€æ°—ã‚’ã¤ã‘ã‚‹ã¹ãã“ã¨ ã€Œé«˜æœ¨æµ©å…‰ï¼ è‡ªå®…ã®æ—¥è¨˜ã€ã‚ˆã‚Šï¼Ž ギャーã€ã“ã“ã‚‚æœæ’°ã ã£ãŸã€‚（モニタリング用ã®ã‚³ãƒ¼ãƒ‰ã¨ã¯ã„ãˆã€‚） int connectionTriedCount = 0; int handshakeSucceededCount = 0; int extractionSucceededCount = 0; connectionTriedCount++; handshakeSucceededCount++; extractionSucceededCount++; java.util.concurrent.atomic.AtomicInteger を使ã£ã¦ã¿ã‚ˆã†ã€‚ import java.util.concurrent.atomic.AtomicInteger; ... AtomicInteger connectionTriedCount = new AtomicInt
Parallelism /= Concurrency
If you want to make programs go faster on parallel hardware, then you need some kind of concurrency. Right? In this article I’d like to explain why the above statement is false, and why we should be very clear about the distinction between concurrency and parallelism. I should stress that these ideas are not mine, and are by no means new, but I think it’s important that this issue is well unders
Making asynchronous function calls with QFuture
QtConcurrent::run() runs a function in a worker thread. It returns a QFuture, which is then used to synchronize with the result: QString foo(); QFuture<QString> f = QtConcurrent::run(foo); ... QString string = f.result() Calling f.result() will block the current thread until foo() has returned. The QFuture template argument must match the return type of foo(). If the function you want to run takes
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
JVM ã®ä¸¦è¡Œæ€§: Java 8 ã§ã®ä¸¦è¡Œå‡¦ç†ã®åŸºç¤Ž
Go Concurrency Patterns: Pipelines and cancellation - The Go Programming Language
Engineering Concurrent Library Components
Dataflow Programming: Handling Huge Data Loads Without Adding Complexity
Google Code Archive - Long-term storage for Google Code Project Hosting.
Concurrency Control and Recovery in Database Systems - Microsoft Research
{{#tags}}- {{label}}
{{/tags}}