[B! concurrent] kyabã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

kyab id:kyab

concurrentã«é–¢ã™ã‚‹kyabã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (5)

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

ãªãœErlang/OTPãªã®ã‹ - kuenishi's blog
ã“ã®ãƒ†ãƒ¼ãƒžè‡ªä½“ã¯ã•ã‚“ã–ã‚“èªžã‚Šå°½ãã•ã‚Œã¦ã„ã‚‹ã“ã¨ã§ã‚ã‚‹ã€‚ãŸã¨ãˆã°å±±å£å›ã«ã‚ˆã‚‹Why Erlang? ã¨ã„ã†ãƒ–ãƒã‚°è¨˜äº‹ã®ç¿»è¨³ã‚„ã€æˆ¦é—˜æ©Ÿæœ¬ï¼ˆProgramming Erlang: Software for a Concurrent World (Pragmatic Programmers)ï¼‰ã‚’èªã‚ã°ä¸–é–“ã§ã„ã‚ã‚Œã¦ã„ã‚‹ã“ã¨ã¯ã‚ˆãåˆ†ã‹ã‚‹ã€‚ã‚‚ã—ãã¯ã€åŒåƒšãŒæœ€è¿‘æ›¸ã„ãŸã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ãƒ‡ã‚¶ã‚¤ãƒ³ã®è¨˜äº‹ã‚’èªã‚“ã§ã‚‚ã‚‰ã£ã¦ã‚‚ã‚ˆã„ã ã‚ã†ã€‚ Software Design (ã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ ãƒ‡ã‚¶ã‚¤ãƒ³) 2014å¹´ 02æœˆå· [é›‘èªŒ] å‡ºç‰ˆç¤¾/ãƒ¡ãƒ¼ã‚«ãƒ¼: æŠ€è¡“è©•è«–ç¤¾ç™ºå£²æ—¥: 2014/01/18ãƒ¡ãƒ‡ã‚£ã‚¢: é›‘èªŒã“ã®å•†å“ã‚’å«ã‚€ãƒ–ãƒã‚° (3ä»¶) ã‚’è¦‹ã‚‹ ç§è‡ªèº«ã‚‚Erlangã«å‡ºä¼šã£ã¦ã‹ã‚‰5,6å¹´ãŒçµŒã¨ã†ã¨ã—ã¦ã„ã‚‹ãŒã€å½“åˆã¯ãã®ã‚ˆã•ãŒã‚ˆãã‚ã‹ã£ã¦ã„ãªã‹ã£ãŸã‚ˆã†ã«æ€ã†ã€‚ã—ã‹ã—ã€ä»•äº‹ã§é«˜å¯ç”¨æ€§ãŒè¦æ±‚ã•ã‚Œã‚‹è¤‡é›‘ãªåˆ†æ•£ã‚·ã‚¹ãƒ†ãƒ ã«æºã‚ã‚‹ã‚ˆã†
kyab 2014/02/19
Shared nothing/Erlangçš„ãªãƒ—ãƒã‚»ã‚¹ã”ã¨ã«GC

erlang

ãƒ—ãƒã‚»ã‚¹

ãƒ¡ãƒ¢ãƒª

ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°

Concurrent
ãƒªãƒ³ã‚¯
The C10M problem
Scalability. It's the question that drives us. It's an anomaly inherent to the programming of the matrix. It's time for servers to handle 10 million simultaneous connections, don't you think? After all, computers now have 1000 times the memory as 15 years ago when the first started handling 10 thousand connections. Today (2013), $1200 will buy you a computer with 8 cores, 64 gigabytes of RAM, 10-g
kyab 2014/02/18
c10k

concurrency

concurrent

performance
ãƒªãƒ³ã‚¯
Thousands of Threads and Blocking I/O
This document summarizes a talk about different server models using synchronous I/O (thread-per-connection) versus asynchronous I/O (NIO). The talk discusses the evolution of server designs from simple multithreaded models to NIO-based approaches. It presents arguments for both approaches but notes that benchmarks showed synchronous I/O to be faster than NIO in some cases, contradicting common bel
kyab 2014/02/17
C10KãŒé¨’ãŒã‚ŒãŸã“ã‚ã‹ã‚‰æ™‚ä»£ã¯ç§»ã£ãŸã€‚connectionã”ã¨ã«threadã¤ãã£ã¦ã‚‚ã€ãƒ¡ãƒ¢ãƒªæ¶ˆè²»ã¯ã¨ã‚‚ã‹ãã‚³ãƒ³ãƒ†ã‚ã‚¹ãƒˆã‚¹ã‚¤ãƒƒãƒã¯ååˆ†æ—©ããªã£ãŸã—ãƒ€ã‚¤ã‚¸ãƒ§ãƒ–ã˜ã‚ƒãï¼Ÿã£ã¦è©±

C10k

Concurrent
ãƒªãƒ³ã‚¯
è¦‹ãˆãªã„ãƒã‚«ãƒ©: ã€ç¿»è¨³ã€‘ã‚¢ã‚¯ã‚¿ãƒ¼ã«ã‚ˆã‚‹ä¸¦åˆ—æ€§ã€ãã—ã¦Rubyã§Goroutine
Ilya Grigorikã•ã‚“ã® "Concurrency with Actors, Goroutines & Ruby" ã‚’ç¿»è¨³ã—ã¾ã—ãŸã€‚ å…ƒè¨˜äº‹ã¯ã“ã¡ã‚‰ï¼š http://www.igvita.com/2010/12/02/concurrency-with-actors-goroutines-ruby/ ï¼ˆç¿»è¨³ã®å…¬é–‹ã¨ç”»åƒã®åˆ©ç”¨ã¯æœ¬äººã‚ˆã‚Šè¨±è«¾æ¸ˆã¿ã§ã™ï¼‰ ç¿»è¨³ã®é–“é•ã„ç‰ãŒã‚ã‚Œã°ãƒ–ãƒã‚°ã‚³ãƒ¡ãƒ³ãƒˆã‚„Twitter(@oshow)ãªã©ã§é æ…®ç„¡ãã”æŒ‡æ‘˜ãã ã•ã„ã€‚ ã‚¢ã‚¯ã‚¿ãƒ¼ã«ã‚ˆã‚‹ä¸¦åˆ—æ€§ã€ ãã—ã¦Rubyã§Goroutine ä¸¦åˆ—ã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ãƒ†ã‚£ãƒ³ã‚°ã®ä¸–ç•Œã¯è¤‡é›‘ãªã‚‚ã®ã ã€‚ç§ãŸã¡ã¯ãƒãƒ¼ãƒ‰ã‚¦ã‚§ã‚¢ã€ãƒ©ãƒ³ã‚¿ã‚¤ãƒ ã€ãã—ã¦åŠãƒ€ãƒ¼ã‚¹ã‚‚ã®ç•°ãªã‚‹ãƒ¢ãƒ‡ãƒ«ã¨ãƒ—ãƒªãƒŸãƒ†ã‚£ãƒ–ã‹ã‚‰é¸æŠžã™ã‚‹ã“ã¨ã‚’è€ƒãˆãªã‘ã‚Œã°ãªã‚‰ãªã„ï¼š fork / waitã€ã‚¹ãƒ¬ãƒƒãƒ‰ã€ã‚·ã‚§ã‚¢ãƒ¼ãƒ‰ãƒ¡ãƒ¢ãƒªã€ãƒ¡ãƒƒã‚»ãƒ¼ã‚¸ãƒ‘ãƒƒã‚·ãƒ³ã‚°ã€ã‚»ãƒžãƒ•ã‚©ã€ãã—ã¦ãƒˆãƒ©ãƒ³ã‚¶ã‚¯ã‚·ãƒ§ãƒ³ãªã©ã€‚ã‚†ãˆã«
kyab 2014/02/08
ä¸¦åˆ—å‡¦ç†ã€‚ã‚¹ãƒ¬ãƒƒãƒ‰ãƒ¢ãƒ‡ãƒ«ã¨ã‚¢ã‚¯ã‚¿ãƒ¼/goroutineãƒ¢ãƒ‡ãƒ«

ruby

ãƒ—ãƒã‚»ã‚¹

concurrent

go

programming
ãƒªãƒ³ã‚¯
The Go scheduler - Morsing's blog
30 June 2013 The Go scheduler Introduction One of the big features for Go 1.1 is the new scheduler, contributed by Dmitry Vyukov. The new scheduler has given a dramatic increase in performance for parallel Go programs and with nothing better to do, I figured I'd write something about it. Most of what's written in this blog post is already described in the original design doc. It's a fairly compreh
kyab 2013/11/27
go

golang

scheduler

concurrent
ãƒªãƒ³ã‚¯
1