[B! lock-free] kamipoã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

kamipo id:kamipo

lock-freeã«é–¢ã™ã‚‹kamipoã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (18)

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

${{author_name}}$
{{author_name}}{{created}}
{{ #comment }}{{ comment }}{{ /comment }}
- {{ label }}

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

Lock-free ã‚¹ãƒŠãƒƒãƒ—ã‚·ãƒ§ãƒƒãƒˆã®æ’®ã‚Šæ–¹ã‚’èª¬æ˜Žã—ã¦ã¿ã‚‹ - ãã¾ãƒ¡ãƒ¢
ãƒžãƒ«ãƒã‚¹ãƒ¬ãƒƒãƒ‰ãªã©ã®ç’°å¢ƒä¸‹ã§æ™‚é–“çµŒéŽã«ã‚ˆã£ã¦å‹æ‰‹ã«å¤‰åŒ–ã™ã‚‹è¤‡æ•°ã®å¤‰æ•°ã‚’èªã¿ãŸã„å ´é¢ã¯å¤šãã‚ã‚Šã¾ã™ã€‚ ã—ã‹ã—CPUã¯ä¸€åº¦ã«ä¸€ã¤ã—ã‹å€¤ã‚’èªã¿æ›¸ãã§ããªã„ã®ã§ã€ç°¡å˜ã«ã¯å‡ºæ¥ã¾ã›ã‚“ã€‚ ä½•æ•…ãªã‚‰èªã‚“ã§ã‚‹ãã°ã‹ã‚‰å€¤ãŒå¤‰å‹•ã—ã¦ã§ãŸã‚‰ã‚ãªå€¤ã‚’èªã‚€ã‹ã‚‚çŸ¥ã‚Œãªã„ã‹ã‚‰ã§ã™ã€‚ å¤‰å‹•ã—ã¦ã‚‹ã‚‚ã®ã‚’èªã‚€ã®ã ã‹ã‚‰èªã‚€å´ãŒå®Œç’§ã˜ã‚ƒãªãã¦ã‚‚ä»•æ–¹ãªã„ã¨ã„ã†å¦¥å”ã¯æœ‰ã‚Šå¾—ã¾ã™ãŒ ç‰¹å®šã®ã‚ã‚‹ä¸€çž¬ã®æ™‚åˆ»ã§ã®çŠ¶æ…‹ã‚’å†™çœŸã®ã‚ˆã†ã«ãƒ‘ãƒãƒªã¨ãƒ•ã‚£ãƒ«ãƒ ã«åŽã‚ã‚‰ã‚ŒãŸã‚‰å¬‰ã—ã„ã§ã™ã‚ˆãã€‚ ä¸€ç•ªç°¡å˜ãªã®ã¯ãƒãƒƒã‚¯ã‚’å–ã‚ŠãªãŒã‚‰èªã‚€äº‹ã§ã™ãŒã€ãƒãƒƒã‚¯ã¯è«¸èˆ¬ã®äº‹æƒ…ã«ã‚ˆã‚Šä½¿ãˆãªã„äº‹ã¨ã—ã¾ã™ã€‚ å‰æ å€¤ãŒå‹æ‰‹ã«å¤‰å‹•ã™ã‚‹ã¨ã„ã†çŠ¶æ³ãŒåˆ†ã‹ã‚Šã«ãã„ã¨æ€ã†ã®ã§ã€é©å½“ãªä¾‹ãˆã¨ã—ã¦åµã®åµåŒ–ã‚’æƒ³åƒã—ã¦ã¿ã¾ã—ã‚‡ã†ã€‚ ã€Œåµã€â†’ã€Œãƒ’ãƒ“ã€â†’ã€Œã²ã‚ˆã“ã€ã€€ã®é †ã§ãƒ©ãƒ³ãƒ€ãƒ ã«å‹æ‰‹ã«é€²ã‚“ã§è¡Œãã¾ã™ã€‚æ¢ã‚ã‚‹ã“ã¨ã¯å‡ºæ¥ã¾ã›ã‚“ã—å¾Œæˆ»ã‚Šã‚‚ã—ã¾ã›ã‚“ã€‚ ã“ã‚“ãªåµãŒè¤‡æ•°ã‚ã‚‹åµåŒ–å™¨ã®ç›£è¦–ã‚’ä»»ã•ã‚ŒãŸã¨ã—ã¾ã™ã€‚åµã®çŠ¶æ…‹
kamipo 2012/05/08
lock-free
ãƒªãƒ³ã‚¯
å†¬ã®Lock-Freeç¥ã‚Š
Please select the category that most closely reflects your concern about theÂ presentation, so that we can review it and determine whether it violates our Terms of Use or isn't appropriate for all viewers.
kamipo 2011/12/12
lock-free
ãƒªãƒ³ã‚¯
Lock-free Stack - ãã¾ãƒ¡ãƒ¢
ã§ã¯Lock-free Stackã«ã¤ã„ã¦å›³ã¨ãƒ—ãƒã‚°ãƒ©ãƒ ã‚’äº¤ãˆãªãŒã‚‰èª¬æ˜Žã—ã¾ã™ã€‚C++ã§ã¯ãªãCã‚’ä½¿ã„ã¾ã™ã€‚ ã“ã‚Œã¯è¤‡æ•°ã‚¹ãƒ¬ãƒƒãƒ‰ã‹ã‚‰ãƒãƒƒã‚¯ã«ã‚ˆã‚‹æŽ’ä»–ç„¡ã—ã§å…±æœ‰ã§ãã‚‹ã‚¹ã‚¿ãƒƒã‚¯ã§ã€å¤–éƒ¨ã«ã¯ node* top; void push(const T*, node** top); bool pop(T*, node** top); ã‚’æä¾›ã—ã¾ã™ã€‚*1 ã“ã®ã‚¹ã‚¿ãƒƒã‚¯ã¯bottomã¸ã¨ç¹‹ãŒã‚‹ç·šå½¢ãƒªã‚¹ãƒˆã‚’ãƒ™ãƒ¼ã‚¹ã¨ã—ã¦å‹•ä½œã™ã‚‹ãŸã‚ã€é…åˆ—ãƒ™ãƒ¼ã‚¹ã®ã‚¹ã‚¿ãƒƒã‚¯ã«ãƒ‘ãƒ•ã‚©ãƒ¼ãƒžãƒ³ã‚¹ã§åŠ£ã‚‹ã“ã¨ã‚‚ã‚ã‚Šã¾ã™ã€‚*2 ãã®ç·šå½¢ãƒªã‚¹ãƒˆã‚’æ§‹æˆã™ã‚‹ãƒŽãƒ¼ãƒ‰ã®ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã‹ã‚‰è¦‹ã¦ã¿ã¾ã—ã‚‡ã†ã€‚ struct node{ T data; node* next; }; ã”ãå…¸åž‹çš„ãªç·šå½¢ãƒªã‚¹ãƒˆã®ãƒŽãƒ¼ãƒ‰ã¨åŒã˜ã§ã™ã€‚ é“å…·ã®ç´¹ä»‹ lock-freeãƒ‡ãƒ¼ã‚¿æ§‹é€ ã‚’æ§‹æˆã™ã‚‹å ´åˆã«é »å‡ºã®Compare And Swapã€‚ Cè¨€èªžã®æ“¬ä¼¼ã‚³ãƒ¼ãƒ‰ã§æ›¸ãã¨ä»¥ä¸‹ã®ã‚ˆã†ãª
kamipo 2011/05/17
lock-free
ãƒªãƒ³ã‚¯
non-blockingã®æ„å‘³ã™ã‚‹ã¨ã“ã‚ - ãã¾ãƒ¡ãƒ¢
æµ·å¤–ã®æ–‡çŒ®ã‚’èªã¿æ¼ã£ã¦ã„ã‚‹ã¨æ°—ã¥ãã®ã§ã™ãŒ 2003å¹´ã‚’å¢ƒã«ã“ã®æ–‡è„ˆã§ä½¿ã‚ã‚Œã‚‹è¨€è‘‰ã®å®šç¾©ãŒå¤‰ã‚ã‚Šã¾ã™ã€‚ â†‘2003å¹´ã”ã‚ã¾ã§ã®æ§‹å›³ â†‘ç¾åœ¨ã®æ§‹å›³ã€‚*1 non-blocking = obstruction-free ã¨ã„ã†ç†è§£ã§ã‚‚ãŠãŠã‚ˆãé–“é•ã„ã§ã¯ãªã„ã¨ã¯æ€ã„ã¾ã™ãŒ è«–æ–‡ã‚’èªã‚€ã«å½“ãŸã£ã¦ non-blocking = ãƒãƒƒã‚¯ã‚’ä½¿ã‚ãªã„ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ å…¨èˆ¬ obstruction-free = éžlock-freeã ã‘ã©ãƒãƒƒã‚¯ã ã‘ã¯ã—ãªã„ ã¨ã„ã†ãƒ‹ãƒ¥ã‚¢ãƒ³ã‚¹ã®é•ã„ã‚’æ„Ÿã˜ã¾ã™ã€‚ ä»¥å¾Œã€ç¾åœ¨ã®æ§‹å›³ã®æ–¹ã‚’å‰æã«è©±ã—ã¾ã™ã€‚ã”æ³¨æ„ãã ã•ã„ã€‚ ã¾ãšã¯3ã¤ã®åˆ†é¡žã®é•ã„ã‹ã‚‰ wait-free æ“ä½œãŒã€Œä»–ã®ã‚¹ãƒ¬ãƒƒãƒ‰ã®å‹•å‘ã«é–¢ã‚ã‚‰ãšæœ‰é™ã‚¹ãƒ†ãƒƒãƒ—ã§å®Œäº†ã§ãã‚‹ã€å ´åˆã€ãã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯wait-freeã¨å‘¼ã°ã‚Œã¾ã™ã€‚starvation-freeã¨å‘¼ã‚“ã ã‚Šã‚‚ã—ã¾ã™ã€‚ å®Ÿéš›ã«ã¯åˆã‚ã‹ã‚‰ã“ã“ã«åˆ†é¡žã•ã‚Œã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯å¤šãã‚
kamipo 2011/05/17
lock-free
ãƒªãƒ³ã‚¯
ABAå•é¡Œ - Wikipedia
ã“ã®è¨˜äº‹ã«ã¯å‚è€ƒæ–‡çŒ®ã‚„å¤–éƒ¨ãƒªãƒ³ã‚¯ã®ä¸€è¦§ãŒå«ã¾ã‚Œã¦ã„ã¾ã™ãŒã€è„šæ³¨ã«ã‚ˆã‚‹å‚ç…§ãŒä¸ååˆ†ã§ã‚ã‚‹ãŸã‚ã€æƒ…å ±æºãŒä¾ç„¶ä¸æ˜Žç¢ºã§ã™ã€‚ é©åˆ‡ãªä½ç½®ã«è„šæ³¨ã‚’è¿½åŠ ã—ã¦ã€è¨˜äº‹ã®ä¿¡é ¼æ€§å‘ä¸Šã«ã”å”åŠ›ãã ã•ã„ã€‚ï¼ˆ2023å¹´1æœˆï¼‰ ABAå•é¡Œï¼ˆè‹±: ABA probl emï¼‰ã¨ã¯ã€ãƒžãƒ«ãƒã‚¹ãƒ¬ãƒƒãƒ‰ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã«ãŠã„ã¦åŒæœŸåŒ–ã®éŽç¨‹ã§ç™ºç”Ÿã™ã‚‹å•é¡Œã§ã‚ã‚Šã€ã‚ã‚‹è¨˜æ†¶åŸŸã‚’äºŒå›žèªã¿å‡ºã—ã€äºŒå›žã®èªã¿å‡ºã—ãŒåŒã˜å€¤ã§ã‚ã‚‹ã“ã¨ã‚’ã€Œå¤‰æ›´ãŒãªã„ã€ã¨ã¿ãªã™ã“ã¨ã«ã—ãŸã¨ãã€äºŒå›žã®èªã¿å‡ºã—ã®é–“ã«åˆ¥ã®ã‚¹ãƒ¬ãƒƒãƒ‰ãŒå€¤ã‚’å¤‰æ›´ã—ã€ä»–ã®ä½œæ¥ã‚’è¡Œã£ãŸå¾Œã¾ãŸå…ƒã®å€¤ã«æˆ»ã™ã¨ã€æœ€åˆã®ã‚¹ãƒ¬ãƒƒãƒ‰ãŒèª¤ã£ã¦ã€Œå¤‰æ›´ãŒãªã‹ã£ãŸã€ã¨ã¿ãªã—ã¦ã—ã¾ã†ã¨ã„ã†ã‚‚ã®ã§ã‚ã‚‹ã€‚ ABA å•é¡Œã¯ã€è¤‡æ•°ã®ã‚¹ãƒ¬ãƒƒãƒ‰ã‚„(or ãƒ—ãƒã‚»ã‚¹)ãŒå…±æœ‰ã•ã‚ŒãŸãƒ¡ãƒ¢ãƒªã«ã‚¢ã‚¯ã‚»ã‚¹ã™ã‚‹å ´åˆã«ç”Ÿã˜ã‚‹ã€‚ä¸‹è¨˜ã®ã‚¤ãƒ™ãƒ³ãƒˆã®æµã‚Œã¯ã€ABA å•é¡Œã‚’ç™ºç”Ÿã•ã›ã‚‹ã€‚ ãƒ—ãƒã‚»ã‚¹ ãŒå…±æœ‰ãƒ¡ãƒ¢ãƒªã‹ã‚‰å€¤ A ã‚’èªã¿å‡ºã™ ã¯ãƒ—ãƒªã‚¨ãƒ³ãƒ—ãƒˆã•ã‚Œã€ãƒ—ãƒã‚»ã‚¹
kamipo 2011/03/02
lock-free

cas
ãƒªãƒ³ã‚¯
CAS based Lock-Free Queue - ãƒžãƒ«ãƒã‚³ã‚¢æ™‚ä»£ã®"ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã¨ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ "å†å…¥é–€
ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã¨ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ å†å…¥é–€ ã¯ã˜ã‚ã« ãƒ»ä¸¦{è¡Œ|åˆ—} & {Lock|Wait}Free ãƒ»ABA & ABA' ãƒ»volatile ï¼† ãƒ¡ãƒ¢ãƒªãƒãƒªã‚¢ ãƒ»ãƒ—ãƒªãƒŸãƒ†ã‚£ãƒ– ãƒ»CAS ãƒ»MCAS ãƒ»STM ãƒ»ãƒ¡ãƒ¢ãƒªç®¡ç†:free & GC ãƒ»Toots List & Skiplist [å˜æ–¹å‘List] ãƒ»ãƒªã‚¹ãƒˆ ãƒ»ç´°ç²’åº¦ãƒªã‚¹ãƒˆ ãƒ»Lazyãƒªã‚¹ãƒˆ ãƒ»Lock-Freeãƒªã‚¹ãƒˆ ãƒ»Lock-Freeãƒªã‚¹ãƒˆ2 [SkipList] ãƒ»ã‚¹ã‚ãƒƒãƒ—ãƒªã‚¹ãƒˆ ãƒ»Lazyã‚¹ã‚ãƒƒãƒ—ãƒªã‚¹ãƒˆ ãƒ»Lock-freeã‚¹ã‚ãƒƒãƒ—ãƒªã‚¹ãƒˆ [åŒæ–¹å‘List] Queue & PriorityQueue [UnBounded Queue] ãƒ»Queue ãƒ»CAS based Lock-Free Queue ãƒ»LL/SC based Lock-Free Queue [Unbounded Priority Queue] ãƒ»Heap
kamipo 2011/03/02
lock-free

cas
ãƒªãƒ³ã‚¯
LL/SC based Lock-Free Queue - ãƒžãƒ«ãƒã‚³ã‚¢æ™‚ä»£ã®"ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã¨ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ "å†å…¥é–€
ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã¨ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ å†å…¥é–€ ã¯ã˜ã‚ã« ãƒ»ä¸¦{è¡Œ|åˆ—} & {Lock|Wait}Free ãƒ»ABA & ABA' ãƒ»volatile ï¼† ãƒ¡ãƒ¢ãƒªãƒãƒªã‚¢ ãƒ»ãƒ—ãƒªãƒŸãƒ†ã‚£ãƒ– ãƒ»CAS ãƒ»MCAS ãƒ»STM ãƒ»ãƒ¡ãƒ¢ãƒªç®¡ç†:free & GC ãƒ»Toots List & Skiplist [å˜æ–¹å‘List] ãƒ»ãƒªã‚¹ãƒˆ ãƒ»ç´°ç²’åº¦ãƒªã‚¹ãƒˆ ãƒ»Lazyãƒªã‚¹ãƒˆ ãƒ»Lock-Freeãƒªã‚¹ãƒˆ ãƒ»Lock-Freeãƒªã‚¹ãƒˆ2 [SkipList] ãƒ»ã‚¹ã‚ãƒƒãƒ—ãƒªã‚¹ãƒˆ ãƒ»Lazyã‚¹ã‚ãƒƒãƒ—ãƒªã‚¹ãƒˆ ãƒ»Lock-freeã‚¹ã‚ãƒƒãƒ—ãƒªã‚¹ãƒˆ [åŒæ–¹å‘List] Queue & PriorityQueue [UnBounded Queue] ãƒ»Queue ãƒ»CAS based Lock-Free Queue ãƒ»LL/SC based Lock-Free Queue [Unbounded Priority Queue] ãƒ»Heap
kamipo 2011/03/02
lock-free

cas
ãƒªãƒ³ã‚¯
ä¸¦åˆ—ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ï¼ˆãã®ï¼’ï¼‰ : DSASé–‹ç™ºè€…ã®éƒ¨å±‹
3.Memory Ordering ã‚·ãƒ³ã‚°ãƒ«ãƒ—ãƒã‚»ãƒƒã‚µã®ãƒžãƒ«ãƒã‚¹ãƒ¬ãƒƒãƒ‰ã§ã¯ã€volatileå¤‰æ•°ã‚’ãƒ•ãƒ©ã‚°ã«ã—ã¦ç°¡å˜ãªåŒæœŸã‚’æ›¸ãã“ã¨ãŒã§ãã¾ã—ãŸã€‚ ä¾‹ãˆã°ã€æ¬¡ã®ã‚ˆã†ãªæ„Ÿã˜ã§ã™ã€‚ï¼ˆã‚³ãƒ³ãƒ‘ã‚¤ãƒ©ã¯volatileå¤‰æ•°ã¸ã®ã‚¢ã‚¯ã‚»ã‚¹ã®é †åºã‚’å…¥ã‚Œæ›¿ãˆãªã„ã‚‚ã®ã¨ã—ã¾ã™ï¼‰ volatile int done = 0; volatile struct { int foo; int bar; } foobar; void writer(void) { foobar.foo = fizz(); foobar.bar = bazz(); done = 1; } void reader(void) { int foo, bar; while (!done) sleep(1); foo = foobar.foo; bar = foobar.bar; } ã“ã‚Œã¯ã€ãƒžãƒ«ãƒãƒ—ãƒã‚»ãƒƒã‚µç’°å¢ƒã§ã¯ä¸Šæ‰‹ãã„ã‹ãªã„ã“ã¨ãŒã‚ã‚Šã¾ã™ã€‚ä»Šæ™‚
kamipo 2010/08/25
lock-free
ãƒªãƒ³ã‚¯
ä¸¦åˆ—ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ï¼ˆãã®ï¼“ï¼‰ : DSASé–‹ç™ºè€…ã®éƒ¨å±‹
4.Atomicãªãƒ¡ãƒ¢ãƒªæ›¸ãæ›ãˆ ãã®ï¼‘ã§ã€å˜ç´”ãªLoad/Storeã«ã¤ã„ã¦ã®Atomicã«ã¤ã„ã¦èª¬æ˜Žã—ã¾ã—ãŸã€‚ ã“ã‚“ã©ã¯ã€Read-Modify-Writeã«ã¤ã„ã¦ã«ã¤ã„ã¦è€ƒãˆã¾ã™ã€‚ Read-Modify-Writeã‚’è¤‡æ•°ã®ã‚¹ãƒ¬ãƒƒãƒ‰ãŒå®Ÿè¡Œã™ã‚‹éš›ã€ãƒžãƒ«ãƒãƒ—ãƒã‚»ãƒƒã‚µç’°å¢ƒã§ åŒæœŸã‚’å–ã‚‹ã«ã¯ã€ãã®ãƒ—ãƒã‚»ãƒƒã‚µã®ãƒ¡ãƒ¢ãƒªãƒ¢ãƒ‡ãƒ«ã«æ²¿ã£ãŸåŒæœŸæ©Ÿæ§‹ãŒå¿…è¦ã§ã™ã€‚ ãã®ãŸã‚ã€å¤§æŠµã®CPUã«ã¯ã€AtomicãªLoad&Storeå‘½ä»¤ã‚’æŒã£ã¦ã„ã¾ã™ã€‚Loadã¨StoreãŒ Atomicã§ã‚ã‚‹ã¨ã„ã†ã“ã¨ã¯ã€Loadã—ã¦ã‹ã‚‰Storeã™ã‚‹ã¾ã§ã®é–“ã«ä»–ã®ãƒ—ãƒã‚»ãƒƒã‚µãŒ Loadã‚‚Storeã‚‚ã§ããªã„ï¼ˆï¼ãƒã‚¹ãƒãƒƒã‚¯ã—ã¦ã„ã‚‹ï¼‰ã¨ã„ã†ã“ã¨ã§ã™ã€‚ ä¾‹ãˆã°ã€ãƒãƒƒã‚¯å¤‰æ•°ã‚’ä¸€ã¤ç”¨æ„ã—ã¦ã€ãã‚ŒãŒ0ã ã£ãŸã‚‰ã ã‚Œã‚‚ãƒãƒƒã‚¯ã—ã¦ã„ãªã„ã®ã§ 1ã«æ›¸ãæ›ãˆã¦ãƒãƒƒã‚¯å¯èƒ½ã€1ã ã£ãŸã‚‰èª°ã‹ãŒãƒãƒƒã‚¯ã—ã¦ã„ã‚‹ã®ã§0ã«ãªã‚‹ã®ã‚’å¾…ã¤ã€ ã¨ã„ã†ã“ã¨ã«ã—ã¾ã™ã€‚XC
kamipo 2010/08/25
lock-free
ãƒªãƒ³ã‚¯
ã€Žãƒžãƒ«ãƒã‚¹ãƒ¬ãƒƒãƒ‰ãƒ—ãƒã‚°ãƒ©ãƒ ï¼ˆãã®ï¼•ãã‚‰ã„ï¼Ÿï¼‰ã€
ã‚‚ã†ã€ãƒžãƒ«ãƒã‚¹ãƒ¬ãƒƒãƒ‰é£½ãã¦ããŸãƒ»ãƒ»ãƒ»ãƒ» æ°—ã‚’å–ã‚Šç›´ã—ã¦ã€å‰å›žãŠè©±ã—ãŸLOCK FREEã®æ¦‚å¿µã‚’ä½¿ã£ã¦ ã‚¹ã‚¿ãƒƒã‚¯ã‚’ä½œã‚Šç›´ã—ã¦ã¿ã¾ã—ã‚‡ã†ã€‚ åŸºæœ¬çš„ãªå†…å®¹ã¯å¤‰ã‚ã‚Šã¾ã›ã‚“ã€‚ æ§‹é€ ä½“ã‚‚ã¾ã‚‹ã£ãã—åŒã˜ã§ã™ã€‚ template <class T> class lock_free_stack : protected boost::noncopyable { protected: struct snode_type{ T* value; snode_type* next; snode_type(T* nin_value,snode_type* nin_next) : value( nin_value ) , next( nin_next ) {} }; snode_type* tail; snode_type* dummy; unsigned int counter; public: //constract
kamipo 2010/08/17
lock-free

cas
ãƒªãƒ³ã‚¯
ç„¡è¦–ã§ããªã„ãƒ•ãƒ©ã‚°ãƒ¡ãƒ³ãƒ†ãƒ¼ã‚·ãƒ§ãƒ³å•é¡Œã¸ã®è§£ç”ã¯ï¼Ÿï¼ˆ2/2ï¼‰ ï¼ ï¼ IT
1æœˆç‰ˆã€€ç„¡è¦–ã§ããªã„ãƒ•ãƒ©ã‚°ãƒ¡ãƒ³ãƒ†ãƒ¼ã‚·ãƒ§ãƒ³å•é¡Œã¸ã®è§£ç”ã¯ï¼Ÿ å°å´Žè³‡åºƒ 2010/2/10 ãƒ¦ãƒ¼ã‚¶ãƒ¼ç©ºé–“ã§RCUï¼Ÿ membarrier()ã‚·ã‚¹ãƒ†ãƒ ã‚³ãƒ¼ãƒ«ã¨ã¯ Mathieu Desnoyersã«ã‚ˆã£ã¦ã€ã€Œintroduce sys_membarrier(): process-wide memory barrierã€ã¨é¡Œã•ã‚ŒãŸãƒ‘ãƒƒãƒãŒæŠ•ç¨¿ã•ã‚Œã¾ã—ãŸã€‚ sys_membarrier()ã¯ã€ãã®åã®ã¨ãŠã‚Šã€ãƒ¡ãƒ¢ãƒªãƒãƒªã‚¢ï¼ˆæ³¨3ï¼‰ã‚’ç™ºè¡Œã™ã‚‹ã‚·ã‚¹ãƒ†ãƒ ã‚³ãƒ¼ãƒ«ã§ã™ã€‚ã€Œãƒ¡ãƒ¢ãƒªãƒãƒªã‚¢ãã‚‰ã„ãƒ¦ãƒ¼ã‚¶ãƒ¼ç©ºé–“ã‹ã‚‰å‹æ‰‹ã«ç™ºè¡Œã™ã‚Œã°ã„ã„ã˜ã‚ƒãªã„ã‹ã€‚ã‚·ã‚¹ãƒ†ãƒ ã‚³ãƒ¼ãƒ«ã«ã™ã‚‹å¿…è¦æ€§ãŒã¾ã£ãŸããªã„ã‚ˆã€ã¨æ€ã†ã‹ã‚‚ã—ã‚Œã¾ã›ã‚“ãŒã€ã“ã‚Œã«ã¯ã¡ã‚ƒã‚“ã¨ç†ç”±ãŒã‚ã‚Šã¾ã™ã€‚ ã¡ã‚‡ã£ã¨é•·ããªã‚Šã¾ã™ãŒã€ã¾ãšã¯èƒŒæ™¯ã‚’ã°ã€‚ Mathieuã¯LTTngã®ä½œè€…ã¨ã—ã¦æœ‰åã§ã€æœ€è¿‘ã¯ã€LTTngï¼ˆé–¢é€£è¨˜äº‹ï¼‰ã¸ã®é«˜é€Ÿãªãƒ¦ãƒ¼ã‚¶ãƒ¼ç©ºé–“ãƒˆãƒ¬ãƒ¼ã‚·ãƒ³ã‚°æ©Ÿèƒ½ã®è¿½åŠ ã«åŠ›ã‚’å…¥ã‚Œã¦ã„ã¾
kamipo 2010/02/15
linux

kernel

lock-free
ãƒªãƒ³ã‚¯
ãƒžãƒ«ãƒã‚³ã‚¢æ™‚ä»£ã®Lock-freeå…¥é–€ - yamasaã®ãƒã‚¿å¸³
æœ¬æ—¥ã€ä¸¦ã‚«ãƒ³ã«ã¦Lock-freeã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã«ã¤ã„ã¦ç™ºè¡¨ã—ã¾ã—ãŸã€‚ç™ºè¡¨è³‡æ–™ã¯ä»¥ä¸‹ã«ãªã‚Šã¾ã™ã€‚ ãªãŠã€ä»Šå›žã®ç™ºè¡¨ã§å‰²æ„›ã—ãŸãƒ¡ãƒ¢ãƒªãƒãƒªã‚¢ã®è©³ç´°ã«ã¤ã„ã¦ã¯ã€ä»¥ä¸‹ã®ç™ºè¡¨è³‡æ–™ã‚’å‚ç…§ãã ã•ã„ã€‚ ãã‚ãã‚volatileã«ã¤ã„ã¦ä¸€è¨€ã„ã£ã¦ãŠãã‹ ã¾ãŸã€Hazard pointerã‚„ã‚¿ã‚°ä»˜ããƒã‚¤ãƒ³ã‚¿ã‚’ä½¿ç”¨ã—ãŸã‚µãƒ³ãƒ—ãƒ«ã‚³ãƒ¼ãƒ‰ã‚’ä»¥ä¸‹ã«ç½®ã„ã¦ã„ã¾ã™ã€‚ã“ã¡ã‚‰ã‚‚å‚è€ƒã«ã©ã†ãžã€‚ yamasa/lockfree - GitHub ãƒžãƒ«ãƒã‚³ã‚¢æ™‚ä»£ã®Lock-freeå…¥é–€View more presentations or Upload your own.
kamipo 2010/02/01
lock-free

ãƒžãƒ«ãƒã‚³ã‚¢

ãƒžãƒ«ãƒã‚¹ãƒ¬ãƒƒãƒ‰
ãƒªãƒ³ã‚¯
Load-Link/Store-Conditional - Wikipedia
load-linkï¼ˆãƒãƒ¼ãƒ‰ãƒ»ãƒªãƒ³ã‚¯ã€ï¼ˆLLã€ä»–ã« load-linkedï¼ˆãƒãƒ¼ãƒ‰ãƒªãƒ³ã‚¯ãƒˆï¼‰ã¾ãŸã¯ load and reserveï¼ˆãƒãƒ¼ãƒ‰ãƒ»ã‚¢ãƒ³ãƒ‰ãƒ»ãƒªã‚¶ãƒ¼ãƒ´ï¼‰ï¼‰ã¨ store-conditionalï¼ˆã‚¹ãƒˆã‚¢ãƒ»ã‚³ãƒ³ãƒ‡ã‚£ã‚·ãƒ§ãƒŠãƒ«ã€ï¼ˆSCï¼‰ã¯çµ„ã¿åˆã‚ã›ã¦ä½¿ç”¨ã•ã‚Œã‚‹ã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿ã®å‘½ä»¤ã€‚ã“ã‚Œã«ã‚ˆã‚Šãƒãƒƒã‚¯ãªã—ã®ã‚¢ãƒˆãƒŸãƒƒã‚¯ãªãƒªãƒ¼ãƒ‰ãƒ»ãƒ¢ãƒ‡ã‚£ãƒ•ã‚¡ã‚¤ãƒ»ãƒ©ã‚¤ãƒˆæ“ä½œ[1]ãŒå¯èƒ½ã¨ãªã‚‹ã€‚ load-link å‘½ä»¤ã¯æŒ‡å®šã•ã‚ŒãŸãƒ¡ãƒ¢ãƒªä½ç½®ã®ç¾åœ¨ã®å†…å®¹ã‚’è¿”ã™ã€‚ãã®å¾Œã® store-conditional å‘½ä»¤ã¯åŒã˜ãƒ¡ãƒ¢ãƒªä½ç½®ã¸æ–°ãŸãªå€¤ã‚’æ›¸ãè¾¼ã‚€ãŒã€å‰å›žã® load-link å‘½ä»¤ä»¥é™ã«ãã®ãƒ¡ãƒ¢ãƒªä½ç½®ã®å†…å®¹ãŒæ›¸ãæ›ãˆã‚‰ã‚Œã¦ã„ãªã„ã¨ãã ã‘æ›¸ãè¾¼ã¿ãŒè¡Œã‚ã‚Œã‚‹ã€‚ä½•ã‚‰ã‹ã®æ›´æ–°ãŒãªã•ã‚Œã¦ã„ãŸã‚‰ã€ãŸã¨ãˆ load-link å‘½ä»¤ã§èªã¿å–ã£ãŸå€¤ã¨åŒã˜å†…å®¹ãŒæ›¸ã‹ã‚Œã¦ã„ãŸã¨ã—ã¦ã‚‚ store-conditional å‘½ä»¤ã¯å¤±æ•—ã™ã‚‹ã€‚å¾“ã£ã¦ã€
kamipo 2010/01/14
lock-free

cas
ãƒªãƒ³ã‚¯
Lock-freeã¨Wait-freeã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ - Wikipedia
Lock-freeã¨Wait-freeã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¨ã¯ã€å…±æœ‰ãƒ‡ãƒ¼ã‚¿ã«ãƒãƒƒã‚¯ã‚’ã‹ã‘ã¦ã‚¢ã‚¯ã‚»ã‚¹ã‚’é˜²ãã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¨ã¯é•ã„ã€è¤‡æ•°ã®ã‚¹ãƒ¬ãƒƒãƒ‰ãŒåŒæ™‚ä¸¦è¡Œçš„ã«ã€ã‚ã‚‹å¯¾è±¡ãƒ‡ãƒ¼ã‚¿ã‚’å£Šã™ã“ã¨ãªã—ã«èªã¿æ›¸ãã™ã‚‹ã“ã¨ã‚’å¯èƒ½ã«ã™ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã‚ã‚‹ã€‚Lock-free ã¨ã¯ã‚¹ãƒ¬ãƒƒãƒ‰ãŒãƒãƒƒã‚¯ã—ãªã„ã“ã¨ã‚’æ„å‘³ã—ã¦ãŠã‚Šã€å…¨ã¦ã®ã‚¹ãƒ†ãƒƒãƒ—ã«ãŠã„ã¦ã‚·ã‚¹ãƒ†ãƒ ãŒå¿…ãšé€²è¡Œã™ã‚‹ã€‚ã“ã‚Œã¯Lock-free ã§ã¯ãƒŸãƒ¥ãƒ¼ãƒ†ãƒƒã‚¯ã‚¹ã‚„ã‚»ãƒžãƒ•ã‚©ã¨ã„ã£ãŸã€æŽ’ä»–åˆ¶å¾¡ã®ãŸã‚ã®ãƒ—ãƒªãƒŸãƒ†ã‚£ãƒ–ã‚’ä½¿ã£ã¦ã¯ãªã‚‰ãªã„ã“ã¨ã‚’æ„å‘³ã™ã‚‹ã€‚ãªãœãªã‚‰ãƒãƒƒã‚¯ã‚’æŒã£ã¦ã„ã‚‹ã‚¹ãƒ¬ãƒƒãƒ‰ã®å®Ÿè¡ŒãŒä¸æ–ã—ãŸå ´åˆã€å…¨ä½“ã®é€²è¡Œã‚’é˜»æ¢ã—ã†ã‚‹ã‹ã‚‰ã§ã‚ã‚‹ã€‚Wait-free ã¨ã¯ã€ä»–ã®ã‚¹ãƒ¬ãƒƒãƒ‰ã®å‹•ä½œã«é–¢ä¿‚ãªãã€ã‚¹ãƒ¬ãƒƒãƒ‰ãŒã„ã‹ãªã‚‹æ“ä½œã‚‚æœ‰é™ã®ã‚¹ãƒ†ãƒƒãƒ—ã§æ“ä½œã‚’å®Œäº†ã•ã›ã‚‰ã‚Œã‚‹ã“ã¨ã‚’æŒ‡ã™ã€‚ã‚ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŒLock-freeã§ã‚ã‚‹ãŒWait-freeã§ãªã„ã“ã¨ã¯ã‚ã‚Šã†ã‚‹ã€‚Wait-free ãªã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
kamipo 2010/01/14
lock-free

cas
ãƒªãƒ³ã‚¯
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
kamipo 2010/01/14
lock-free

cas
ãƒªãƒ³ã‚¯
lucille development blog Â» Blog Archive Â» 64-bit Lock-free queue implementation
http://lucille.atso-net.jp/svn/angelina/algo/lock-free/ [EN] Hereâ€™s my implementation of Simon Doherty, Maurice Herlihy, Victor Luchangco and Mark Moir, Bringing practical lock-free synchronization to 64-bit applications. PODC 2004. pp. 31â€“39. http://www.cs.brown.edu/research/projects/transactional_memory.html â€“ [JP] 64-bit å¯¾å¿œãª lock-free queue ã‚’å®Ÿè£…ã—ã¦ã¿ã¾ã—ãŸã€‚ ã“ã®è«–æ–‡ã®ç‰¹å¾´ã¯ã€ o 64-bit å¯¾å¿œ o ã‚¹ãƒ¬ãƒƒãƒ‰æ•°ã‚’ã‚ã‚‰ã‹ã˜ã‚çŸ¥ã‚‰
kamipo 2010/01/14
lock-free

cas
ãƒªãƒ³ã‚¯
ã‚³ãƒ³ãƒšã‚¢ãƒ»ã‚¢ãƒ³ãƒ‰ãƒ»ã‚¹ãƒ¯ãƒƒãƒ— - Wikipedia
ã‚³ãƒ³ãƒšã‚¢ãƒ»ã‚¢ãƒ³ãƒ‰ãƒ»ã‚¹ãƒ¯ãƒƒãƒ—ï¼ˆCompare-and-Swapã€CASï¼‰ã¯ã€CPUã®ç‰¹åˆ¥ãªå‘½ä»¤ã®ä¸€ç¨®ã€‚ä¸å¯åˆ†æ“ä½œã¨ã—ã¦ã€ã‚ã‚‹ãƒ¡ãƒ¢ãƒªä½ç½®ã®å†…å®¹ã¨æŒ‡å®šã•ã‚ŒãŸå€¤ã‚’æ¯”è¼ƒã—ã€ç‰ã—ã‘ã‚Œã°ãã®ãƒ¡ãƒ¢ãƒªä½ç½®ã«åˆ¥ã®æŒ‡å®šã•ã‚ŒãŸå€¤ã‚’æ ¼ç´ã™ã‚‹ã€‚ã“ã®æ“ä½œã®çµæžœã€ç½®æ›ãŒè¡Œã‚ã‚ŒãŸã‹ã©ã†ã‹ã‚’ç¤ºã™å¿…è¦ãŒã‚ã‚Šã€å˜ç´”ãªçœŸç†å€¤ã‚’è¿”ã™ã‹ã€ãã®ãƒ¡ãƒ¢ãƒªä½ç½®ã‹ã‚‰èªã¿è¾¼ã‚“ã å†…å®¹ï¼ˆæ›¸ãè¾¼ã‚“ã å†…å®¹ã§ã¯ãªã„ï¼‰ã‚’è¿”ã™ã€‚ CASå‘½ä»¤ã¯ã€ãƒžãƒ«ãƒãƒ—ãƒã‚»ãƒƒã‚µã‚·ã‚¹ãƒ†ãƒ ã§ã‚»ãƒžãƒ•ã‚©ãªã©ã‚’å®Ÿè£…ã™ã‚‹ã®ã«ä½¿ã‚ã‚Œã‚‹ã€‚ãƒžãƒ«ãƒãƒ—ãƒã‚»ãƒƒã‚µã‚·ã‚¹ãƒ†ãƒ ã§Lock-freeã¨Wait-freeã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’å®Ÿè£…ã™ã‚‹ã®ã«ã‚‚ä½¿ã‚ã‚Œã‚‹ã€‚ Maurice Herlihy (1993å¹´) ã¯ã€CASå‘½ä»¤ãŒå˜ãªã‚‹ãƒªãƒ¼ãƒ‰ã€ãƒ©ã‚¤ãƒˆã‚„ãƒ†ã‚¹ãƒˆãƒ»ã‚¢ãƒ³ãƒ‰ãƒ»ã‚»ãƒƒãƒˆã§ã¯å®Ÿè£…ã§ããªã„ã“ã¨ã‚’ç¤ºã—ãŸ[1]ã€‚ CASå‘½ä»¤ã‚’åˆ©ç”¨ã—ãŸã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯ã€ä¸€èˆ¬ã«ã‚ã‚‹ã‚ãƒ¼ã¨ãªã‚‹ãƒ¡ãƒ¢ãƒªä½ç½®ã‚’èªã¿å–ã‚Šã€ãã®å¤ã„å€¤ã‚’è¨˜æ†¶ã—ã¦ãŠãã€‚ãã®å¤ã„
kamipo 2009/06/16
lock-free

cas
ãƒªãƒ³ã‚¯
1