is OpenBSD 10x faster than Linux?
Here’s a little benchmark complements of Jann Horn. It’s unexpectedly slow on Linux. OpenBSD is so fast, I had to modify the program slightly to measure itself, as the time utility is missing sufficient precision to even record nonzero. All it does is create one extra thread, then both existing threads create 256 sockets. What’s so hard about that? #include <pthread.h> #include <unistd.h> #include
Protothreadsã®ç´¹ä»‹ã¨è§£æž - Qiita
èªã‚€äººã¸ ãªã‚‹ã¹ãã‚ã‹ã‚Šã‚„ã™ã説明を行ã†ã¤ã‚‚ã‚Šã§ã¯ã‚ã‚Šã¾ã™ãŒã€ マルãƒã‚¹ãƒ¬ãƒƒãƒ‰ã«ãŠã‘ã‚‹Stack(スタック)ã€Context Switching(コンテã‚ストスイッãƒãƒ³ã‚°)ã€Blocking(ブãƒãƒƒã‚ング)ç‰ã®æ¦‚念をãŠæŒã¡ã®æ–¹ãŒå¯¾è±¡ã§ã‚ã‚Šã¾ã™ã®ã§äºˆã‚ã”了承ãŠé¡˜ã„ã—ã¾ã™ã€‚ ãã‚Œã‹ã‚‰ã€æœ¬è¨˜äº‹ã«é–¢ã—ã¦ã¯ã‚ãã¾ã§è‡ªå·±è²¬ä»»ã§å‚考ã¾ã§ã«ã•ã›ã¦ãã ã•ã„。 ã¯ã˜ã‚ã« Embedded(組込ã¿)S/W世界ã§ã¯å¤šæ§˜ãªH/W構æˆã«ç›´é¢ã™ã‚‹ã“ã¨ãŒä¸€èˆ¬çš„ã§ã‚ã‚Šã¾ã™ã€‚ 特ã«IoTãŒæµè¡Œã£ã¦ã‚‹ç¾æ™‚代ã§ã¯OSã¾ã§ã‚‚è¦ã‚‰ãªã„å°è¦æ¨¡ãªH/W構æˆã§å®Œçµã™ã‚‹å ´åˆãŒå¤šã„ã§ã™ã€‚ 例ãˆã°ã€ã‚»ãƒ³ã‚µãƒ¼ã‚’ã°ã‚‰æ’’ãã€ã‚る特定ã®å ´æ‰€ã®æ°—温を計測ã—ãŸã„å ´åˆã¯ è€ƒæ…®äº‹é …ã¨ã—ã¦ã‚³ã‚¹ãƒˆã‚„çœé›»ç‰(ä»–ã®è¦ç´ ã‚‚ã‚ã‚‹)を考ãˆã€ 最å°é™ã®H/W構æˆã§æ°—温装置を実ç¾ã™ã‚‹ã®ãŒæ±‚ã‚られã¾ã™ã€‚ ãã‚“ãªH/W構æˆã§ãƒªã‚½ãƒ¼ã‚¹ã€ç‰¹ã«ãƒ¡ãƒ¢ãƒªç‰ãŒé™ã£ãŸæ™‚ã«å½¹ã«ç«‹ã¤ Prototh
WaitOnAddressã¯ä½•ã®å½¹ã«ç«‹ã¤ã®ã‹ - .mjtã®æ—¥è¨˜å¾©å¸°è¨ˆç”»
prev: http://d.hatena.ne.jp/mjt/20120916/p1 注目ã™ã¹ãWindows 8ã®æ–°æ©Ÿèƒ½ã«ã€æ–°è¦ã«å°Žå…¥ã•ã‚ŒãŸå¹¾ã¤ã‹ã®åŒæœŸãƒ—リミティブãŒã‚る。Windows 8/2012ã®SDKã§ã¯ã€Synchapi.hç‰ã®ãƒ˜ãƒƒãƒ€ãŒè¿½åŠ ã•ã‚Œã€åŒæœŸãƒ—リミティブã¯ãã¡ã‚‰ã«ç§»å‹•ã—ãŸã€‚ WaitOnAddress WakeByAddressSingle WakeByAddressAll ã¯ã€ã‚¢ãƒ‰ãƒ¬ã‚¹ã¨ãã‚ŒãŒæŒ‡ã™å€¤ã‚’使用ã—ã¦ã‚¹ãƒ¬ãƒƒãƒ‰é–“ã®åŒæœŸã‚’実ç¾ã™ã‚‹ã‚‚ã®ã§ã€ã‚«ãƒ¼ãƒãƒ«ã‚ªãƒ–ジェクトã§ã¯ãªã„ã®ã§ä½¿ã„ãŸã„放題ã¨ã„ã†ãƒã‚¤ãƒ³ãƒˆãŒã‚る。ã¤ã¾ã‚Šã€ã“ã‚Œã¯ä»–ã®ã‚ˆã‚Šé«˜æ©Ÿèƒ½ãªåŒæœŸã‚ªãƒ–ジェクトを作るã¨ãã®ãƒ—リミティブã¨ã—ã¦ä½¿ç”¨ã§ãる。 WaitOnAddressã¯ã€ã‚¢ãƒ‰ãƒ¬ã‚¹ã¨ã‚µã‚¤ã‚ºã€æ¯”較元アドレスをå–ã‚Šã€æ¯”較元アドレス == アドレスã®ã¨ãã«å¯ã‚‹ã€‚ãã†ã§ãªã„å ´åˆã¯å¯ãªã„。スレッドを起ã“ã—ãŸã„時ã¯ã‚¢ãƒ‰ãƒ¬ã‚¹ã«å¯¾
Enter paradis — A new chapter in Rust's parallelism story | Andreas Longva
Rust is a great language for data-parallel problems with relatively simple parallel access patterns. It particularly excels when the data can be split up into contiguous chunks. On the other hand, things can get messy for parallel access patterns that are non-contiguous or less structured. In this post, I will show you an uglier side of parallelism in Rust. Thankfully, it is not a fundamental flaw
1024cores
Hi! My name is Dmitry Vyukov, and I'm going to share here various information about lockfree, waitfree, obstructionfree synchronization algorithms and data structures, scalability-oriented architecture, multicore/multiprocessor design patterns, high-performance computing, threading technologies and libraries (OpenMP, TBB, PPL), message-passing systems and related topics. I'm mostly interested in s
PASAN: Detecting Peripheral Access Concurrency Bugs within Bare-Metal Embedded Applications | USENIX
éžåŒæœŸã¨ä¸¦åˆ— / morrita - Message Passing
karino2 ㌠並列プãƒã‚°ãƒ©ãƒ ã‹ã‚‰è¦‹ãŸFuture ã¨ã„ã†ãƒ“デオを作ã£ã¦å…¬é–‹ã—ã¦ã„ãŸã®ã§ã€å¼•ã£è¶Šã—ã®è·é€ ã‚Šã‚’ã—ãªãŒã‚‰çœºã‚ãŸã€‚ é•·ã„ã®ã§ã“ã“ã«ã–ã£ãã‚Šã¨ã—ãŸä¸»å¼µã‚’ã¾ã¨ã‚ã‚‹ã¨: Future/Promise (ãŠã‚ˆã³ãã®å¾Œé‡œã® async/await) ã¯éžåŒæœŸãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã§ callback hell ã«ãªã‚‰ãªã„発明ã¨ã„ã†è¦‹æ–¹ã‚’ã•ã‚Œã¦ã„ã‚‹ãŒã€ ãã‚‚ãã‚‚ãªãœ callback hell ãŒå¿…è¦ã ã£ãŸã‹ã®æ™‚代背景ãŒå分ã«ç†è§£ã•ã‚Œã¦ã„ãªã„。 背景ã®ä¸€ã¤ã¯ãƒ–ラウザ JavaScript ã®ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ãƒ¢ãƒ‡ãƒ«ã«ã‚·ãƒ³ã‚°ãƒ«ã‚¹ãƒ¬ãƒƒãƒ‰ãƒ»ãƒŽãƒ³ãƒ–ãƒãƒƒã‚ング(イベントループ)ã¨ã„ã†åˆ¶é™ãŒã‚ã£ãŸã‹ã‚‰ã€‚ ã“ã‚Œã¯(特ã«ãƒ•ãƒãƒ³ãƒˆã‚¨ãƒ³ãƒ‰é–‹ç™ºè€…ã®é–“ã§ã¯)よãç†è§£ã•ã‚Œã¦ã„る。 ã‚‚ã†ä¸€ã¤ã®è¦–点㯠SEDA ã¿ãŸã„ãªãƒžãƒ«ãƒã‚¹ãƒ¬ãƒƒãƒ‰ãƒ»ãƒŽãƒ³ãƒ–ãƒãƒƒã‚ング環境ã®å¿…è¦æ€§ã§ã€ ã“ã£ã¡ã¯ã„ã¾ã„ã¡åºƒãç†è§£ã•ã‚Œã¦ã„ãªã„よã†ã«æ€ãˆã‚‹ã€‚ çµæžœã¨ã—
Title Page - The Rust Performance Book
Press ↠or → to navigate between chapters Press S or / to search in the book Press ? to show this help Press Esc to hide this help
「強ã„メモリモデルã€ã¨ã€Œå¼±ã„メモリモデル〠- yamasaã®ãƒã‚¿å¸³
Apple M1ã«ã¤ã„ã¦ã®é¢ç™½ã„記事を見ã‹ã‘ã¦ã€ä¹…ã—ã¶ã‚Šã«ãƒ¡ãƒ¢ãƒªãƒ¢ãƒ‡ãƒ«å±‹(?)ã®è¡€ãŒé¨’ã„ã ã®ã§ãƒ–ãƒã‚°ã‚’書ã。 note.com å¼·ã„メモリモデル ç¾ä»£ã®CPUアーã‚テクãƒãƒ£ã§ã¯ã€x86(64bit, 32bitã©ã¡ã‚‰ã‚‚)ãŒã€Œå¼·ã„メモリモデルã€ã‚’採用ã—ã¦ãŠã‚Šã€ãれ以外ã®ãƒ¡ã‚¸ãƒ£ãƒ¼ãªCPUãŒã€Œå¼±ã„メモリモデルã€ã‚’採用ã—ã¦ã„る。ã“ã®ã€Œå¼·ã„メモリモデルã€ã€Œå¼±ã„メモリモデルã€ã«ã¤ã„ã¦ã€ã¾ãšãŠã•ã‚‰ã„ã—ã¦ãŠã“ã†ã€‚ 以下ã®ã‚ˆã†ã«ã€2ã¤ã®å¤‰æ•°a, bã«å¯¾ã—ã¦ç•°ãªã‚‹CPUコアãŒåŒæ™‚ã«ã‚¢ã‚¯ã‚»ã‚¹ã—ãŸã¨ã™ã‚‹ã€‚ int a = 0; int b = 0; CPU1: a = 1; b = 1; CPU2: int r1 = b; int r2 = a; (上記ã¯C言語ã«ä¼¼ãŸç–‘似コードを用ã„ã¦ã„ã‚‹ãŒã€å®Ÿéš›ã¯æ©Ÿæ¢°èªžå‘½ä»¤ã«ãªã£ã¦ã„ã‚‹ã¨è€ƒãˆã¦ã»ã—ã„。ã¤ã¾ã‚Šã€CPU1ã¯å¤‰æ•°a, bã®ç¤ºã™ãƒ¡ãƒ¢ãƒªã‚¢ãƒ‰ãƒ¬ã‚¹ã«å¯¾ã™ã‚‹ã‚¹ãƒˆã‚¢å‘½ä»¤ã‚’実行ã—ã¦
Using TLA+ in the Real World to Understand a Glibc Bug
Using TLA+ in the Real World to Understand a Glibc Bug by Malte Skarupke TLA+ is a formal specification language that you can use to verify programs. It’s different from other formal verification systems in that it’s very pragmatic. Instead of writing proofs, it works using the simple method of running all possible executions of a program. You can write assertions and if they’re not true for any p
sync.WaitGroupã®æ£ã—ã„使ã„æ–¹ - Qiita
Goroutineを複数使ã£ã¦ä¸¦åˆ—ã§å‡¦ç†ã‚’è¡Œã£ã¦ã€ãã‚ŒãŒã™ã¹ã¦å®Œäº†ã—ãŸã‚‰æ¬¡ã«é€²ã¿ãŸã„ã¨ã—よã†ã€‚Goroutineã®å®Œäº†ã¯ãれを生æˆã—ãŸgoroutineã«é€šçŸ¥ã•ã‚Œã‚‹ã‚ã‘ã§ã¯ãªã„ã®ã§ã€ãƒ¡ã‚¤ãƒ³ã®goroutineã¯ä½•ã‚‰ã‹ã®ãƒ¡ã‚«ãƒ‹ã‚ºãƒ を使ã£ã¦å…¨å“¡ãŒå®Œäº†ã™ã‚‹ã¾ã§å¾…ã£ã¦ã€å…¨å“¡ãŒå®Œäº†ã—ãŸã‚‰å®Ÿè¡Œã‚’å†é–‹ã™ã‚‹å¿…è¦ãŒã‚る。 sync.WaitGroupã¯è¤‡æ•°ã®goroutineã®å®Œäº†ã‚’å¾…ã¤ãŸã‚ã®å€¤ã （Javaを知ã£ã¦ã„ã‚Œã°ã€java.util.concurrent.CountDownLatchã«ã‚ˆãä¼¼ã¦ã„る）。WaitGroupã®å€¤ã«å¯¾ã—ã¦ãƒ¡ã‚½ãƒƒãƒ‰Waitを呼ã¶ã¨ã€WaitGroupãŒ0ã«ãªã‚‹ã¾ã§Waitã¯ãƒ–ãƒãƒƒã‚¯ã•ã‚Œã‚‹ï¼ˆå¾…ãŸã•ã‚Œã‚‹ï¼‰ã€‚従ã£ã¦ã€ã‚„ã‚ŠãŸã„処ç†ã®æ•°ã ã‘WaitGroupã®å€¤ã‚’インクリメントã—ã¦ãŠã„ã¦ã€å‡¦ç†å®Œäº†æ™‚ã«ãƒ‡ã‚¯ãƒªãƒ¡ãƒ³ãƒˆã™ã‚Œã°ã€Waitを呼んã§å‡¦ç†å®Œäº†ã‚’å¾…ã£ã¦ã„るメインã®goroutineã¯ã€
A fork() in the road ã‚’èªã‚“ã§.md
A fork() in the road ã‚’èªã‚“ã§.md A fork() in the road ã‚’èªã‚“㧠HotOS 2019 㧠Microsoft Research ã‹ã‚‰ã®è«–æ–‡ã§ã‚る．Unixã®ä»£è¡¨çš„ãªã‚·ã‚¹ãƒ†ãƒ コールã§ã‚ã‚‹fork()ã«ã¤ã„ã¦ã®å•é¡Œç‚¹ã‚’挙ã’ã¦ã„る． æ¦‚è¦ fork()ã¯æœ€ã‚‚基本的ãªã‚·ã‚¹ãƒ†ãƒ コールã¨ã„ã£ã¦ã‚‚良ã，新ã—ã„プãƒã‚»ã‚¹ã‚’作るã¨ãã«ä½¿ã‚れる．今回ã®è«–æ–‡ã®ä¸»å¼µã¯fork()ã¯1970年代ã®ãƒžã‚·ãƒ³ã§ã¯ãƒãƒƒã‚¯ã¨å‘¼ã¹ã‚‹ã‚‚ã®ã ã£ãŸãŒï¼Œç¾ä»£ã§ã¯éŽåŽ»ã®è² 債ã¨ãªã£ã¦ã„ã‚‹ã¨ã„ã†ã‚‚ã®ã§ãŠã‚Šï¼Œã‚«ãƒ¼ãƒãƒ«ã‹ã‚‰å®Œå…¨ã«å–り除ãã¹ãã§ã‚ã‚‹ã¨ã„ã†ã‚‚ã®ã§ã‚る．ãŸã ã—，ã“ã“ã§ã„ã†ã‚«ãƒ¼ãƒãƒ«ã¨ã¯Linuxカーãƒãƒ«ã®ã“ã¨ã‚’直接指ã—ã¦ã„ã‚‹ã®ã§ã¯ãªã，著者ã®å…ˆè¡Œç ”究ã§ã®OSã®å®Ÿè£…ã®ã“ã¨ã‚’指ã—ã¦ã„る． é¢ç™½ã„ã®ã¯ï¼Œfork()ã¯ç ”究者ã«ã¨ã£ã¦ã¯ç ”究を阻害ã™ã‚‹ã¨ã„ã£ãŸã“ã¨ã‚„，教育者ã¯æ´å²ã¨ã—ã¦ã¯æ•™ãˆã‚‹ã¹ãã ãŒæœ€åˆ
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
GitHub - ocaml-multicore/eio: Effects-based direct-style IO for multicore OCaml
GitHub - godzie44/BugStalker: Rust debugger for Linux x86-64
https://www.bradrodriguez.com/papers/mtasking.html
Defects and Vulnerability Analysis
GitHub - facebook/folly: An open-source C++ library developed and used at Facebook.
https://www.usenix.org/system/files/osdi20-rommel.pdf
https://papers.freebsd.org/2002/jhb-locking_in_multithreaded_kernel.files/jhb-locking_in_multithreaded_kernel-paper.pdf
GitHub - xran-deex/ats-threadpool: A threadpool library for ATS2
{{#tags}}- {{label}}
{{/tags}}