[B! Concurrency] yyamanoã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

yyamano id:yyamano

Concurrencyã«é–¢ã™ã‚‹yyamanoã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (30)

${{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}}

Lessons Learned in Concurrency with Ruby - Part I
The Engine Yard PaaS products are highly complex, and span thousands of servers to serve our customers. Ensuring that our applications run quickly and reliably requires a good understanding of concurrency and parallelization. This blog post is a recap of my journey down the rabbit hole of concurrency in an attempt to solve this probl em in my own development efforts. Part II will be the continuatio
yyamano 2013/02/06
Ruby

Concurrency
ãƒªãƒ³ã‚¯
non-blockingã®æ„å‘³ã™ã‚‹ã¨ã“ã‚ - ãã¾ãƒ¡ãƒ¢
æµ·å¤–ã®æ–‡çŒ®ã‚’èªã¿æ¼ã£ã¦ã„ã‚‹ã¨æ°—ã¥ãã®ã§ã™ãŒ 2003å¹´ã‚’å¢ƒã«ã“ã®æ–‡è„ˆã§ä½¿ã‚ã‚Œã‚‹è¨€è‘‰ã®å®šç¾©ãŒå¤‰ã‚ã‚Šã¾ã™ã€‚ â†‘2003å¹´ã”ã‚ã¾ã§ã®æ§‹å›³ â†‘ç¾åœ¨ã®æ§‹å›³ã€‚*1 non-blocking = obstruction-free ã¨ã„ã†ç†è§£ã§ã‚‚ãŠãŠã‚ˆãé–“é•ã„ã§ã¯ãªã„ã¨ã¯æ€ã„ã¾ã™ãŒ è«–æ–‡ã‚’èªã‚€ã«å½“ãŸã£ã¦ non-blocking = ãƒãƒƒã‚¯ã‚’ä½¿ã‚ãªã„ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ å…¨èˆ¬ obstruction-free = éžlock-freeã ã‘ã©ãƒãƒƒã‚¯ã ã‘ã¯ã—ãªã„ ã¨ã„ã†ãƒ‹ãƒ¥ã‚¢ãƒ³ã‚¹ã®é•ã„ã‚’æ„Ÿã˜ã¾ã™ã€‚ ä»¥å¾Œã€ç¾åœ¨ã®æ§‹å›³ã®æ–¹ã‚’å‰æã«è©±ã—ã¾ã™ã€‚ã”æ³¨æ„ãã ã•ã„ã€‚ ã¾ãšã¯3ã¤ã®åˆ†é¡žã®é•ã„ã‹ã‚‰ wait-free æ“ä½œãŒã€Œä»–ã®ã‚¹ãƒ¬ãƒƒãƒ‰ã®å‹•å‘ã«é–¢ã‚ã‚‰ãšæœ‰é™ã‚¹ãƒ†ãƒƒãƒ—ã§å®Œäº†ã§ãã‚‹ã€å ´åˆã€ãã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯wait-freeã¨å‘¼ã°ã‚Œã¾ã™ã€‚starvation-freeã¨å‘¼ã‚“ã ã‚Šã‚‚ã—ã¾ã™ã€‚ å®Ÿéš›ã«ã¯åˆã‚ã‹ã‚‰ã“ã“ã«åˆ†é¡žã•ã‚Œã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯å¤šãã‚
yyamano 2011/10/21
Concurrency
ãƒªãƒ³ã‚¯
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è¨€èªžã®æ“¬ä¼¼ã‚³ãƒ¼ãƒ‰ã§æ›¸ãã¨ä»¥ä¸‹ã®ã‚ˆã†ãª
yyamano 2011/10/21
CASã‚’ä½¿ã£ãŸã‚¹ã‚¿ãƒƒã‚¯å®Ÿè£…

Concurrency
ãƒªãƒ³ã‚¯
ãƒ¢ãƒ€ãƒ³ä¸¦åˆ—ãƒ»ä¸¦è¡Œãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚° ï½ž Concurrent Revisions ã«ã‚ˆã‚‹å®Ÿè£…ã¨ç¾å®Ÿ ï½ž - Preferred Networks Research & Development
æœ¬æ—¥ç¤¾å†…å‘ã‘ã®TechTalkã«ã¦ã€ä¸¦åˆ—ãƒ»ä¸¦è¡Œãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã«é–¢ã™ã‚‹è©±ã‚’è¡Œã„ã¾ã—ãŸã€‚ æ˜¨ä»Šã€ãƒ—ãƒã‚°ãƒ©ãƒ ã®ä¸¦åˆ—åŒ–ã¯ãªãã¦ã¯ãªã‚‰ãªã„ã‚‚ã®ã¨ãªã£ã¦ã„ã¾ã™ã€‚ã—ã‹ã—ã€ãã®ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ç’°å¢ƒã¯ä¾ç„¶ã¨ã—ã¦ãƒãƒƒã‚¯ã‚’ç”¨ã„ãŸã‚‚ã®ãŒä¸»æµã§ã™ã€‚ä»Šå›žã®ç™ºè¡¨ã®ä¸»å¼µã‚’ç«¯çš„ã«ç”³ã—ä¸Šã’ã¾ã™ã¨ã€ â€œLocks must goï¼â€ ã¨ã„ã†ã“ã¨ã«ãªã‚Šã¾ã™ã€‚ä¸¦åˆ—ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã«éŠ€ã®å¼¾ä¸¸ã¯ã‚ã‚Šã¾ã›ã‚“ã€‚ã—ã‹ã—ã€ãƒãƒƒã‚¯ã¯åˆ¥ã®ä½•ã‚‰ã‹ã®å®‰å…¨æ€§ã‚’ç¢ºä¿ã—ãŸãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ãƒ¢ãƒ‡ãƒ«ã§ç½®ãæ›ãˆã‚‰ã‚Œãªã‘ã‚Œã°ã„ã‘ã¾ã›ã‚“ã€‚ãã†ã§ãªã‘ã‚Œã°ã€å†ç¾ã—ã«ãã„ãƒã‚°ã«è‹¦ã—ã‚ã‚‰ã‚Œã€çµ‚é›»ã‚’é€ƒã™æ—¥ã€…ã¨æ±ºåˆ¥ã™ã‚‹ã“ã¨ã¯ã§ããªã„ã§ã—ã‚‡ã†ã€‚ã¾ãŸã€ãƒãƒƒã‚¯ã«ã‚ˆã‚‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®æŠ±ãˆã‚‹æœ¬è³ªçš„å•é¡Œã«ã‚‚è¨€åŠã—ã¦ã„ã¾ã™ã€‚ ã“ã®ç•Œéšˆã®æœ€æ–°ã®å‹•å‘ã¨ã—ã¦ã€åŽ»å¹´OOPSLAâ€™10ã«ã¦ç™ºè¡¨ã•ã‚ŒãŸConcurrent Revisionsã«ã¤ã„ã¦ã®è§£èª¬ã‚‚è¡Œãªã£ã¦ãŠã‚Šã¾ã™ã€‚ã¾ãŸã€å¼Šç¤¾ç ”ç©¶é–‹ç™ºã«ãŠã„ã¦ã€å…ˆæ—¥Con
yyamano 2011/10/20
Concurrency
ãƒªãƒ³ã‚¯
Efficient data transfer through zero copy
IBM Developer is your one-stop location for getting hands-on training and learning in-demand skills on relevant techno logies such as generative AI, data science, AI, and open source.
yyamano 2011/07/12
Java

Concurrency
ãƒªãƒ³ã‚¯
TotT: Sleeping != Synchronization
yyamano 2008/08/26
CountDownLatchã‚’ä½¿ã£ãŸãƒžãƒ«ãƒã‚¹ãƒ¬ãƒƒãƒ‰ã®ãƒ†ã‚¹ãƒˆã€‚

Testing

Concurrency

Java
ãƒªãƒ³ã‚¯
ä¸¦åˆ—ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã«ã¤ã„ã¦
ãŠæ€¥ãŽã®æ–¹ã¯, çŸç¸®versionã‚’ã©ã†ãž. ã€ä¸¦åˆ—ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¨ã¯ã€‘ åœ°çƒç’°å¢ƒã®ã‚·ãƒŸãƒ¥ãƒ¬ãƒ¼ã‚·ãƒ§ãƒ³, å¤©æ°—äºˆå ±ã§ç”¨ã„ã‚‰ã‚Œã‚‹æ•°å€¤äºˆå ±, é‡ååŠ›å¦ã«åŸºã¥ãåˆ†åè¨è¨ˆ, åŽŸåç‰©ç†, å®‡å®™ç‰©ç†ã®ã‚·ãƒŸãƒ¥ãƒ¬ãƒ¼ã‚·ãƒ§ãƒ³, æµä½“ã®è¨ˆç®—, çµŒæ¸ˆ, ç¤¾ä¼šã‚·ã‚¹ãƒ†ãƒ ã®ã‚·ãƒŸãƒ¥ãƒ¬ãƒ¼ã‚·ãƒ§ãƒ³, ã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿ã‚°ãƒ©ãƒ•ã‚£ãƒƒã‚¯ã‚¹, åºƒåŸŸé€šä¿¡ç¶², é›»åŠ›ç¶²ç‰ã®æœ€é©è¨è¨ˆ, ç”»åƒå‡¦ç†, å¤§è¦æ¨¡ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹, å¤§è¦æ¨¡çŸ¥è˜ãƒ™ãƒ¼ã‚¹ã®æ¤œç´¢ç‰, å¾“æ¥ã®é€æ¬¡åž‹è¨ˆç®—æ©Ÿã§ã¯æ‰±ã†ã®ãŒå›°é›£ãªå¤§è¦æ¨¡ã‹ã¤è¤‡é›‘ãªå•é¡Œã‚’è§£ãå¿…è¦æ€§ã‹ã‚‰, ä¸¦åˆ—è¨ˆç®—æ©Ÿã¸ã®é–¢å¿ƒãŒé«˜ã¾ã£ã¦ãã¦ãŠã‚Š, æ—¢ã«, ã‚³ãƒã‚¯ã‚·ãƒ§ãƒ³ãƒžã‚·ãƒ³[HIL 90]ç‰ã®å•†ç”¨æ©Ÿã‚‚å¸‚å ´ã«å‡ºã•ã‚ŒãŸ. ã—ã‹ã—ãªãŒã‚‰, é€æ¬¡åž‹è¨ˆç®—æ©Ÿç”¨ã«æ›¸ã‹ã‚ŒãŸãƒ—ãƒã‚°ãƒ©ãƒ ã‚’ãã®ã¾ã¾ ä¸¦åˆ—è¨ˆç®—æ©Ÿã«ã‹ã‘ã¦åŠ¹çŽ‡è‰¯ãå‡¦ç†ã•ã›ã‚‹ã“ã¨ãŒã§ãã‚‹ã‚ˆã†ãªä¸¦åˆ—åŒ–ã‚³ãƒ³ãƒ‘ã‚¤ãƒ©ã¯ æ¥µãé™ã‚‰ã‚ŒãŸç”¨é€”ã®ã‚‚ã®ã‚’é™¤ã„ã¦ã¯å½“é¢é–‹ç™ºã•ã‚Œãã†ã‚‚ãªã„. å¾“ã£ã¦,
yyamano 2008/07/18
ä¸¦åˆ—å‡¦ç†ã¨ä¸¦è¡Œå‡¦ç†ã®é•ã„ã€ä¸¦åˆ—å‡¦ç†ã¨åˆ†æ•£å‡¦ç†ã®é•ã„

Concurrency
ãƒªãƒ³ã‚¯
Efficient data transfer through zero copy
IBM Developer is your one-stop location for getting hands-on training and learning in-demand skills on relevant techno logies such as generative AI, data science, AI, and open source.
yyamano 2007/12/11
"This article presents some patterns for using volatile variables effectively"ã€"#1: status flags, #2: one-time safe publication, #3: independent observations, #4: the "volatile bean" pattern, #5: The cheap read-write lock trick"

Java

Concurrency
ãƒªãƒ³ã‚¯
The "Double-Checked Locking is Broken" Declaration
The "Double-Checked Locking is Broken" Declaration Signed by: David Bacon (IBM Research) Joshua Bloch (Javasoft), Jeff Bogda, Cliff Click (Hotspot JVM project), Paul Haahr, Doug Lea, Tom May, Jan-Willem Maessen, Jeremy Manson, John D. Mitchell (jGuru) Kelvin Nilsen, Bill Pugh, Emin Gun Sirer Double-Checked Locking is widely cited and used as an efficient method for implementing lazy initialization
yyamano 2007/12/11
Java

Concurrency
ãƒªãƒ³ã‚¯
IBM Developer
IBM Developer is your one-stop location for getting hands-on training and learning in-demand skills on relevant techno logies such as generative AI, data science, AI, and open source.
yyamano 2007/12/11
Java

Concurrency
ãƒªãƒ³ã‚¯
çµ„ã¿è¾¼ã¿å¸‚å ´ã«ãŠã‘ã‚‹ã€ä¸¦åˆ—åŒ–è¨€èªžã®æ™®åŠã®å¯èƒ½æ€§ã¯ï¼Ÿ | ã‚¹ãƒ©ãƒ‰ ãƒ‡ãƒ™ãƒãƒƒãƒ‘ãƒ¼
ã‚¹ãƒˆãƒ¼ãƒªãƒ¼ by GetSet 2007å¹´10æœˆ08æ—¥ 17æ™‚30åˆ† çµ„è¾¼å‘ã‘ãƒˆãƒ¬ãƒ³ãƒ‰ã®æ˜Žæ—¥ã¯ã©ã£ã¡ã ï¼Ÿ éƒ¨é–€ã‚ˆã‚Š EEtimes Japanã®è¨˜äº‹ã‚ˆã‚Šã€‚çµ„ã¿è¾¼ã¿æ©Ÿå™¨å‘ã‘ãƒ—ãƒã‚»ãƒƒã‚µã‚‚ãƒžãƒ«ãƒã‚³ã‚¢ãƒ»ã‚¢ãƒ¼ã‚ãƒ†ã‚¯ãƒãƒ£ã¸ã¨å¾ã€…ã«ç§»è¡Œã—ã¦ã„ã‚‹æ˜¨ä»Šã ãŒã€è¨˜äº‹ã«ã‚ˆã‚‹ã¨ãƒžãƒ«ãƒã‚³ã‚¢ã®æ€§èƒ½ã‚’å¼•ãå‡ºã™ä¸¦åˆ—ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã¯ã»ã¨ã‚“ã© åˆ©ç”¨ã•ã‚Œã¦ãŠã‚‰ãšã€çµ„ã¿è¾¼ã¿æ©Ÿå™¨å‘ã‘ã‚½ãƒ•ãƒˆã‚¦ã‚¨ã‚¢ã®é–‹ç™ºè€…ã®ã†ã¡85ï¼…ã¯Cè¨€èªžã¾ãŸã¯C++è¨€èªžã‚’ä½¿ã£ã¦ãŠã‚Šã€æ–°ã—ã„ ä¸¦åˆ—ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžãŒæ™®åŠã™ã‚‹å¯èƒ½æ€§ã¯ã»ã¨ã‚“ã©ãªã„ã ã‚ã†ã€ã¨ã•ã‚Œã¦ã„ã‚‹ã€‚ ãƒžãƒ«ãƒã‚³ã‚¢ã®æ€§èƒ½ã‚’å¼•ãå‡ºã™ãŸã‚ã«ä¸¦åˆ—ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã‚’åˆ©ç”¨ã™ã‚‹ã€ã¨ã„ã†ã®ã¯åˆ†ã‹ã‚‰ãªã„ã§ã‚‚ãªã„ã®ã§ã™ãŒã€ çµ„ã¿è¾¼ã¿å‘ã‘ã§ãã‚“ãªã«æ„è˜ã™ã‚‹å¿…è¦ãŒã‚ã‚‹ã®ã‹ãªã€ã¨ã„ã†ç–‘å•ã‚‚ã€‚ãã‚‚ãã‚‚ã€ŒC/C++ä»¥å¤–ã€ã‚’é¸æŠžã™ã‚‹ãƒ¡ãƒªãƒƒãƒˆã¨ã„ã†ã®ã¯ã€ ã©ã®ç¨‹åº¦ã‚ã‚‹ã®ã ã‚ã†ã‹ï¼Ÿ
yyamano 2007/10/09
Embedded

Concurrency
ãƒªãƒ³ã‚¯
The Death of "synchronized"?
yyamano 2007/09/14
Concurrency

Java
ãƒªãƒ³ã‚¯
TheServerSide | Your Java Community discussing server side development
yyamano 2007/09/13
Concurrency

Java
ãƒªãƒ³ã‚¯
Programming for Parrallelism: The Parallel Hierarchies Pattern
yyamano 2007/08/30
Concurrency

Patterns
ãƒªãƒ³ã‚¯
10 Ways to Reduce Lock Contention in Threaded Programs - Thinking Parallel
yyamano 2007/08/01
Concurrency
ãƒªãƒ³ã‚¯
Intel open sources multicore programming tool
yyamano 2007/07/25
Concurrency

C++
ãƒªãƒ³ã‚¯
IBM Developer
IBM Developer is your one-stop location for getting hands-on training and learning in-demand skills on relevant techno logies such as generative AI, data science, AI, and open source.
yyamano 2007/07/23
Java

Concurrency
ãƒªãƒ³ã‚¯
Ten Questions with Joe Duffy about Parallel Programming and .NET Threads - Thinking Parallel
yyamano 2007/07/02
Logically they(Shared-memory and message-passing) are in fact quite similar, aside from the specific logistics of data management, communication, and access.

Concurrency
ãƒªãƒ³ã‚¯
The Problem with Threads | â€¦on Coding | Algorithm.com.au
yyamano 2007/05/23
The Problem with Threadsã«ã¤ã„ã¦ã®ã‚³ãƒ¡ãƒ³ãƒˆ

Concurrency
ãƒªãƒ³ã‚¯
2000ä¸‡å€‹ã®ãƒ—ãƒã‚»ã‚¹ã‚’å‹•ã‹ã™ãŸã‚ã®ä¸¦åˆ—ãƒ¢ãƒ‡ãƒ« - æœ€é€Ÿé…ä¿¡ç ”ç©¶ä¼š(@yamaz)
# ã‚¿ã‚¤ãƒˆãƒ«ã¯ç…½ã‚Šã§ã™. ä»Šé€±æœ«ãƒ‰ãƒªã‚³ãƒ ã•ã‚“ã§Cometã¨ãã®å‘¨è¾ºæŠ€è¡“ï¼ˆã‚¤ãƒ™ãƒ³ãƒˆå‡¦ç†ã€Erlangãªã©ãªã©ï¼‰ã«é–¢ã™ã‚‹å‹‰å¼·ä¼šãŒè¡Œã‚ã‚Œã‚‹ã®ã§,ã“ã“æœ€è¿‘ã¤ã‚‰ã¤ã‚‰è€ƒãˆãŸã‚Šèª¿ã¹ãŸã‚Šã—ã¦ãŸã“ã¨ã‚’å¤–ã«å‡ºã—ã¾ã™.yamazã¯Erlangã®æ–‡æ³•ã¨ã‹ã«ã¯ã‚ã¾ã‚Šèˆˆå‘³ãŒãªã,2000ä¸‡ã®ãƒ—ãƒã‚»ã‚¹ãŒä¸¦åˆ—å®Ÿè¡Œã§ãã‚‹ã¨ã„ã†ãã®ãƒ¢ãƒ‡ãƒ«ã«èˆˆå‘³ãŒã‚ã‚‹ã®ã§,ã¨ã‚Šã‚ãˆãšãã“ã«ã¤ã„ã¦. ãªãŠã„ã¤ã‚‚ã«ã‚‚å¢—ã—ã¦é©å½“ãªã“ã¨æ›¸ã„ã¦ã‚‹ã®ã§,é©å®œãƒžãƒ¦ãƒ„ãƒã§ãŠé¡˜ã„ã—ã¾ã™.ãƒ„ãƒƒã‚³ãƒŸå¤§æ“è¿Ž. Erlangã¯1ãƒžã‚·ãƒ³ã§2000ä¸‡ã®ãƒ—ãƒã‚»ã‚¹ã‚’ä¸¦åˆ—å®Ÿè¡Œã•ã›ã‚‹ã“ã¨ãŒã§ãã‚‹ã‚‰ã—ã„. http://www.atmarkit.co.jp/news/200704/27/erlang.html ç§ã¯ä¸¦åˆ—è¨€èªžã¯VHDLã—ã‹ä½¿ã£ãŸã“ã¨ãŒãªã,ã—ã‹ã‚‚VHDLã¯ã¡ã‚ƒã‚“ã¨ ä¸¦åˆ—å®Ÿè¡Œã‚’è¡Œã†è¦ç´ ãŒå›žè·¯ã®å½¢ã§å®Ÿåœ¨ã™ã‚‹ã®ã§,Erlangã¿ãŸã„ã« 1ãƒžã‚·ãƒ³ã§ä¸¦åˆ—æ€§ã‚’å®Ÿç¾ã™ã‚‹ã“ã¨ã«å¯¾ã—ã¦
yyamano 2007/05/22
Concurrency
ãƒªãƒ³ã‚¯
1 2 æ¬¡ã®ãƒšãƒ¼ã‚¸