How TCP backlog works in Linux
When an application puts a socket into LISTEN state using the listen syscall, it needs to specify a backlog for that socket. The backlog is usually described as the limit for the queue of incoming connections. Because of the 3-way handshake used by TCP, an incoming connection goes through an intermediate state SYN RECEIVED before it reaches the ESTABLISHED state and can be returned by the accept s
割り込ã¿ã®å¾ŒåŠéƒ¨ã€Softirqã€Taskletã€Work Queue
2011å¹´02月15æ—¥ æƒ…å ±ç§‘å¦é¡ž オペレーティングシステムII ç‘æ³¢å¤§å¦ ã‚·ã‚¹ãƒ†ãƒ æƒ…å ±å·¥å¦ç ”究科 コンピュータサイエンス専攻, é›»åãƒ»æƒ…å ±å·¥å¦ç³» 新城 é– <[email protected]> ã“ã®ãƒšãƒ¼ã‚¸ã¯ã€æ¬¡ã® URL ã«ã‚ã‚Šã¾ã™ã€‚ http://www.coins.tsukuba.ac.jp/~yas/coins/os2-2010/2011-02-15 ã‚ã‚‹ã„ã¯ã€æ¬¡ã®ãƒšãƒ¼ã‚¸ã‹ã‚‰æ‰‹ç¹°ã£ã¦ã„ãã“ã¨ã‚‚ã§ãã¾ã™ã€‚ http://www.coins.tsukuba.ac.jp/~yas/ http://www.cs.tsukuba.ac.jp/~yas/ ■今日ã®å¤§äº‹ãªè©± 割り込ã¿ã®å‰åŠéƒ¨ã¨å¾ŒåŠéƒ¨ã®åˆ†é›¢ Softirq Tasklet Work Queue 後åŠéƒ¨ã®ä»•çµ„ã¿ã®é¸æŠž ■割り込ã¿ã€å¾ŒåŠéƒ¨ 割り込ã¿ã®å•é¡Œç‚¹ より優先度ã®é«˜ã„処ç†ã‚ˆã‚Šã‚‚ã€å„ªå…ˆåº¦ã®ä½Žã„割り込ã¿å‡¦ç†ãŒå…ˆã«å®Ÿè¡Œã•ã‚Œ
ãªãœ Haskell ã§ã¯ã‚ューãŒè»½ã‚“ã˜ã‚‰ã‚Œã¦ã„ã‚‹ã‹ï¼Ÿ - ã‚ã©ã‘ãªã„話
Haskell ã§ã¯ã‚ューãŒæ¬²ã—ããªã£ãŸã‚‰ Data.Sequence を使ãˆã¨è¨€ã‚れる。Seq ã¯ä¸¡ç«¯ã‚ューã ã—ã€ã‚·ãƒ¼ã‚±ãƒ³ã‚¹ã¨ã—ã¦ä½¿ãˆã°ã€é€£çµ(><)や分割(splitAt)ãŒã€ãªã‚‰ã—計算é‡ã§ O(log N) ã¨ã„ã†å„ªã‚Œã‚‚ã®ã§ã‚る。ã—ã‹ã—ã€å†…部ãŒfinger treeãªã®ã§ã‚³ãƒ¼ãƒ‰ãŒè¤‡é›‘ãªã®ã¨ã€è¨ˆç®—é‡ãŒã€Œãªã‚‰ã—ã€ãªã¨ã“ã‚ãŒçŽ‰ã«å‚·ã§ã‚る。 ã‚‚ã£ã¨å˜ç´”ã§ã€æœ€æ‚ªè¨ˆç®—é‡ã‚’ä¿è¨¼ã™ã‚‹(両端ã§ãªã„)ã‚ューãŒæ¨™æº–ã§æä¾›ã•ã‚Œã¦ã‚‚ã„ã„æ°—ãŒã™ã‚‹ã€‚ãã®å€™è£œã«ã¯ã€ãƒªã‚¢ãƒ«ã‚¿ã‚¤ãƒ ã‚ューãŒã‚る。ã©ã†ã—ã¦æ¨™æº–ã§ã‚ューãŒæä¾›ã•ã‚Œãªã„ã®ã ã‚ã†ï¼Ÿ 僕ãªã‚Šã®ç”ãˆã¯ã€Œéœ€è¦ãŒãªã„ã€ã 。 å•é¡Œã‚’解ãã¨ãã«ã‚¹ã‚¿ãƒƒã‚¯ã¯ã‚ˆã使ã†ãŒã€ã‚ューãŒå¿…è¦ãªå•é¡Œã¯ãã‚“ãªã«æ€ã„ã¤ã‹ãªã„。僕ã¯ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯å±‹ãªã®ã§ã€ã‚‚ã¡ã‚んルータã«ã¯ã‚ューãŒå¿…è¦ãªã“ã¨ã¯çŸ¥ã£ã¦ã„ã‚‹ãŒã€ãれ以外ã§æœ‰åã©ã“ã‚ã¨è¨€ãˆã°å¹…優先探索ãらã„ã 。 幅優先探索 ã§ã‚‚ã€Haskellã§ã¯ã‚ュー
Writing worker queues, in Go
Have you ever wanted to write something that is highly concurrent, and performs as many tasks as you will let it, in parallel? Well, look no further, here is a guide on how to do just that, in Go! This isn't new For an absolutely riveting (to me) talk on concurrency patterns, I highly recommend watching the following videos: Concurrency is not Parallelism by Rob Pike is a good video to start with,
1
ランã‚ング
ランã‚ング
ランã‚ング
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
GitHub - Shanon/Malba: Job Queue
{{#tags}}- {{label}}
{{/tags}}