GitHub - kaisellgren/Concurrency-concepts: A guide to concurrency, multi-threading and parallel programming concepts. Explains the differences between every concept, their advantages and disadvantages in detail.You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert
maropu/lockbench - GitHub
A benchmark for a variety of spin-lock implementation using x86 primitives. These variations are as follows: * lock_none.h To provide baseline perfor mance compared to other implementation. * lock_tas.h Naive spin-lock implementaiont with test-and-set('xchg'). * lock_tas_nopause.h Based on lock_tas.h, 'pause' is removed. * lock_tas_mov.h Based on lock_tas.h, lock_release() is improved with 'mov' t
最近ã®CPUã®åŒæœŸæ€§èƒ½ã‚’調ã¹ã¦ã¿ãŸ - maropuã®ãƒ¡ãƒ¢å¢“å ´
ã“ã®å‰èª¿ã¹ã”ã¨ã‚’ã—ã¦ã„ã‚‹ã¨ãã«pthread_spinlockãªã‚‹ã‚‚ã®ãŒã‚ã‚‹ã“ã¨ã‚’知ã£ãŸï¼Ž ãã®æ™‚ã«pthread_mutex_lockã¨ã©ã¡ã‚‰ã‚’使ãˆã°ã„ã„ã‚“ã ã‚ã†ï¼Ÿã¨ç–‘å•ã«æ€ã£ãŸã®ã§å°‘ã—調ã¹ã¦ã¿ãŸï¼Ž çµæžœã‹ã‚‰è¨€ãˆã°ï¼ŒãŸã„ã¦ã„ã®å ´åˆã¯pthread_mutex_lockã§è‰¯ã„，ã¨ã„ã†å®‰æ˜“ãªçµæžœã«ãªã£ã¦ã—ã¾ã£ãŸï¼Ž /*--- 以下詳細 ---*/ 一般論ã§ã¯ãƒãƒƒã‚¯æœŸé–“ãŒçŸã„ã¨ãã«spinlockã®ã»ã†ãŒè‰¯ã„ã€ã¨ã„ã‚れるã®ã§æœŸé–“ãŒçŸã„ãƒãƒƒã‚¯ã«ãŠã‘ã‚‹ç°¡å˜ãªæ€§èƒ½è©•ä¾¡ã‚’è¡Œã£ãŸï¼Ž 使ã£ãŸãƒ—ãƒã‚°ãƒ©ãƒ ã¯ä»¥ä¸‹ï¼Ž https://github.com/maropu/lockbench å˜ä¸€ã‚¢ãƒ‰ãƒ¬ã‚¹ä¸Šã«å˜åœ¨ã™ã‚‹å€¤ã‚’åŒæœŸçš„ã«ã‚¤ãƒ³ã‚¯ãƒªãƒ¡ãƒ³ãƒˆã™ã‚‹ã ã‘ã®ç°¡å˜ãªãƒ—ãƒã‚°ãƒ©ãƒ ．評価指標ã¯thread数（# of threads/x-axis）を変化ã•ã›ãŸå ´åˆã®ï¼Œclock()ãŒè¿”ã™å˜ä½“tickã‚ãŸã‚Šã®å¹³å‡ã‚¤ãƒ³ã‚¯ãƒªãƒ¡ãƒ³ãƒˆå›žæ•°ï¼ˆ
Linux スレッドプãƒã‚°ãƒ©ãƒŸãƒ³ã‚°
GNU/Linux ã§ã®ã‚¹ãƒ¬ãƒƒãƒ‰ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚° NPTL (Native POSIX Thread Library) Programming. 以å‰ã‹ã‚‰ GNU/Linux ã§ã‚¹ãƒ¬ãƒƒãƒ‰ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚’ã™ã‚‹ãŸã‚ã®ç°¡å˜ãªã‚¬ã‚¤ãƒ‰ã‚’書ããŸã„ã¨æ€ã£ã¦ã„ã¾ã—ãŸã€‚今更スレッドプãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã«ã¤ã„ã¦æ›¸ã„ã¦ã‚‚目新ã—ã„ã‚‚ã®ã«ãªã‚‹ã¨ã¯æ€ãˆãªã„ã®ã§ã™ãŒã€åˆã‚㦠NPTL (Native POSIX Thread Library) を使ã£ãŸãƒ—ãƒã‚°ãƒ©ãƒ ã‚’ã™ã‚‹ã¨ã„ã†æ–¹ã«ã¯ã€ã‚‚ã—ã‹ã—ãŸã‚‰å½¹ã«ç«‹ã¤æƒ…å ±ã‹ã‚‚ã—ã‚Œã¾ã›ã‚“。ã¯ã˜ã‚ã¯æ€–々å°ã•ãªãƒ—ãƒã‚°ãƒ©ãƒ を書ã„ã¦å‹•ã‹ã—ã¦ã¿ã‚‹ã€‚æ€ã£ãŸã‚ˆã‚Šç°¡å˜ãªã“ã¨ã«é©šã‹ã‚Œã‚‹ã§ã—ょã†ã€‚スレッドプãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¨è¨€ã£ã¦ã‚‚難ã—ã„ã“ã¨ã¯ãªã«ã‚‚ã‚ã‚Šã¾ã›ã‚“。ライブラリãŒæ²¢å±±ä»•äº‹ã‚’ã—ã¦ãã‚‹ãŠã‹ã’ã§å¿«é©ã«ä½¿ã†ã“ã¨ãŒã§ãã¾ã™ã€‚ 本文ä¸ã§ã¯ glibc ã®ãƒãƒ¼ã‚¸ãƒ§ãƒ³ã«ã‚ˆã‚‹é•ã„ã«ã¤ã„ã¦ã‚‚触れã¾ã™ã€‚å‚ç…§ã—ãŸãƒãƒ¼ã‚¸ãƒ§ãƒ³ã¯ gli
atomic operation ã©ã“ã‚ã‹ mutex ã‚‚ã‚ã‹ã£ã¦ãªã‹ã£ãŸã¨ã„ã†è©±ã€€2011-09-05 - 兼雑記
read write lock ã£ã¦ã‚‚ã®ãŒã‚ã‚Šã¾ã™ã€‚ pthread ã 㨠pthread_rwlock_t 。コレã®ç§ã®æ€ã£ã¦ãŸã‚»ãƒžãƒ³ãƒ†ã‚£ã‚¯ã‚¹ã¯ä»¥ä¸‹ã®ã‚ˆã†ãªã‚‚ã‚“ã§ã™ã€‚ writer lock ã‚’å–ã‚‹ã¨æ™®é€šã® mutex lock ã¿ãŸã„ãªæ„Ÿã˜ã€‚ãã® thread ㌠unlock ã™ã‚‹ã¾ã§ã€ä»¥é™ã® reader lock 㨠writer lock 㯠block ã™ã‚‹ã€‚ reader lock ã‚’å–ã‚‹ã¨ã€ãれ以é™ã® writer lock 㯠block ã™ã‚‹ã€‚ reader lock 㯠block ã›ãšã«å–れる ã“れ㯠glibc ã® pthread ã®ãƒ‡ãƒ•ã‚©ãƒ«ãƒˆã®æŒ™å‹•ãªã‚“ã§ã™ãŒã€ã“ã‚Œã¯å¤‰ãˆã‚‰ã‚Œã‚‹ã—〠POSIX ã«ã‚ˆã‚‹ã¨ç’°å¢ƒã«ã‚ˆã£ã¦é•ã†æŒ™å‹•ã‚’ã™ã‚‹ã“ã¨ã‚‚ã‚るらã—ã„ã€ã£ã¦ã®ã‚’知りã¾ã›ã‚“ã§ã—ãŸã€‚ ã©ã†ã„ã†æ™‚ã®æŒ™å‹•ãŒå¤‰ã‚ã‚‹ã‹ã¨ã„ã†ã¨ã€ reader lock ãŒå–られã¦ã¦ã€ writer
Hazard pointer - Wikipedia
This article may be too technical for most readers to understand. Please help improve it to make it understandable to non-experts, without removing the technical details. (January 2014) (Learn how and when to remove this message) In a multithreaded computing environment, hazard pointers are one approach to solving the problems posed by dynamic memory management of the nodes in a lock-free data str
Libtask: a Coroutine Library for C and Unix
Libtask: a Coroutine Library for C and Unix write event-driven programs without the hassle of events! available for FreeBSD, Linux, OS X, and Solaris libtask.tar.gz 386-ucontext.h clock.c power-ucontext.h taskimpl.h COPYRIGHT context.c primes.c tcpproxy.c Makefile fd.c print.c testdelay.c README httpload.c qlock.c testdelay1.c amd64-ucontext.h makesun rendez.c asm.S mips-ucontext.h task.c channel.
Why Threads Are A Bad Idea
Why Threads Are A Bad Idea (for most purposes) John Ousterhout Sun Microsystems Laboratories [email protected] http://www.sunlabs.com/~ouster Introduction υ υ υ υ Threads: – Grew up in OS world (processes). – Evolved into user-level tool. – Proposed as solution for a variety of problems. – Every programmer should be a threads programmer? Problem: threads are very hard to program. Alt
Memory Models: A Case For Rethinking Parallel Languages and Hardware – Communications of the ACM
CACM Web Account Membership in ACM includes a subscription to Communications of the ACM (CACM), the computing industry's most trusted source for staying connected to the world of advanced computing. Sign In Sign Up Most parallel programs today are written using threads and shared variables. Although there is no consensus on parallel programming models, there are a number of reasons why threads rem
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:
1
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
Articles on computer science and optimization.
users:kerneis:software:cpc:index
{{#tags}}- {{label}}
{{/tags}}