[B! algorithm] pochi-mkã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

pochi-mk id:pochi-mk

algorithmã«é–¢ã™ã‚‹pochi-mkã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (7)

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

è«–æ–‡ï½œsnmalloc: A Message Passing Allocator (ISMM 2019)
ã€Œsnmalloc: A Message Passing Allocatorã€ã¨ã„ã†è«–æ–‡ã‚’èªã‚“ã ã®ã§ãã®ç´¹ä»‹ã§ã™ã€‚æœ¬è«–æ–‡ã¯ ISMM (International Symposium on Memory Management) 2019 ã«æŽ¡æŠžã•ã‚Œã¦ãŠã‚Šã€è«–æ–‡ã¨ã‚½ãƒ¼ã‚¹ã‚³ãƒ¼ãƒ‰ã¯ GitHub (microsoft/snmalloc) ã§å…¬é–‹ã•ã‚Œã¦ã„ã¾ã™ã€‚ãƒªãƒã‚¸ãƒˆãƒªåã‹ã‚‰åˆ†ã‹ã‚‹é€šã‚Šã€è‘—è€…ã®å¤šããŒ Microsoft Research ã«æ‰€å±žã—ã¦ã„ã¾ã™ã€‚ å…è²¬ èªã¿é–“é•ãˆã¦ã„ã‚‹å¯èƒ½æ€§ãŒã‚ã‚Šã¾ã™ã€‚æ£ç¢ºãªæƒ…å ±ãŒæ¬²ã—ã„æ–¹ã¯å¿…ãšè«–æ–‡ã‚’èªã‚“ã§ãã ã•ã„ã€‚èª¤ã‚Šã®æŒ‡æ‘˜ã‚„è£œè¶³ã€è°è«–ãªã©ã¯ GitHub Issue ã‚„ Twitter ã¸ãŠé¡˜ã„ã—ã¾ã™ã€‚ æ›´æ–°å±¥æ´ 2019/07/08 bump pointer ã¨ free list ã® next entry pointer ã‚’åˆ¤å®šã™ã‚‹æ–¹æ³•ã«ã¤ã„ã¦è¿½è¨˜ 2019/0
pochi-mk 2019/07/09
malloc

algorithm
ãƒªãƒ³ã‚¯
JavaScriptã§å¤§é‡ã®ã‚ªãƒ–ã‚¸ã‚§ã‚¯ãƒˆã®å½“ãŸã‚Šåˆ¤å®šã‚’åŠ¹çŽ‡çš„ã«ã¨ã‚‹ - Subterranean Flower Blog
ã‚²ãƒ¼ãƒ ãªã©ã®ã‚³ãƒ³ãƒ†ãƒ³ãƒ„ã«ãŠã„ã¦ã€ã€Œå½“ãŸã‚Šåˆ¤å®šã€ã‹ã‚‰é€ƒã‚Œã‚‹ã“ã¨ã¯ã§ãã¾ã›ã‚“ã€‚ã‚ªãƒ–ã‚¸ã‚§ã‚¯ãƒˆã¨ã‚ªãƒ–ã‚¸ã‚§ã‚¯ãƒˆãŒè¡çªã—ãŸã‹ã©ã†ã‹ã¨ã„ã†åˆ¤å®šã¯ã€ã‚¤ãƒ³ã‚¿ãƒ©ã‚¯ãƒ†ã‚£ãƒ–ã‚³ãƒ³ãƒ†ãƒ³ãƒ„ã«ãŠã„ã¦æœ€ã‚‚é‡è¦ãªéƒ¨åˆ†ã«ãªã‚‹ã‹ã‚‰ã§ã™ã€‚ å½“ãŸã‚Šåˆ¤å®šã®å®Ÿè£…è‡ªä½“ã¯é›£ã—ãã‚ã‚Šã¾ã›ã‚“ã€‚ã§ã™ãŒã€ç´ æœ´ãªå®Ÿè£…ã§ã™ã¨ã€å¯¾è±¡ã¨ãªã‚‹ã‚ªãƒ–ã‚¸ã‚§ã‚¯ãƒˆãŒå¤§é‡ã§ã‚ã‚‹å ´åˆã«ã€ååˆ†ãªãƒ‘ãƒ•ã‚©ãƒ¼ãƒžãƒ³ã‚¹ãŒå‡ºã¾ã›ã‚“ã€‚ã“ã‚Œã¯ã‚ªãƒ–ã‚¸ã‚§ã‚¯ãƒˆã®å¤šã„ã€ç¾ä»£çš„ãªã‚²ãƒ¼ãƒ ã§ã—ãŸã‚Šã€å¼¾å¹•ã‚·ãƒ¥ãƒ¼ãƒ†ã‚£ãƒ³ã‚°ãªã©ã‚’ä½œã‚‹ã¨ãã«å¤§ããªéšœå®³ã¨ãªã‚Šã¾ã™ã€‚ ã“ã®è¨˜äº‹ã§ã¯ã€å¤§é‡ã®ã‚ªãƒ–ã‚¸ã‚§ã‚¯ãƒˆã®å½“ãŸã‚Šåˆ¤å®šã‚’å‡¦ç†ã™ã‚‹ã€åŠ¹çŽ‡çš„ãªæ–¹æ³•ã«ã¤ã„ã¦ç´¹ä»‹ã—ã¾ã™ã€‚ ã¾ãšã¯ç´ æœ´ã«å®Ÿè£…ã—ã¦ã¿ã‚‹ å½“ãŸã‚Šåˆ¤å®šã®å‡¦ç†ã‚’èªžã‚‹ã«ã¯ã€ã‚ã‚‹ç¨‹åº¦ã‚²ãƒ¼ãƒ ã®éª¨çµ„ã¿ã®ã‚ˆã†ãªã‚‚ã®ãŒå¿…è¦ã«ãªã£ã¦ãã¾ã™ã€‚ã‚‚ã¡ã‚ã‚“ã‚¯ãƒ©ã‚¹ãªã©ã‚’ä½¿ã‚ãªã„ãƒ™ã‚¿æ›¸ãã§ã‚‚ã‚ˆã„ã®ã§ã™ãŒã€å¤§å¤‰èªã¿ã«ãããªã£ã¦ã—ã¾ã„ã¾ã™ã€‚ã§ã™ã®ã§ã€ä»Šå›žã¯ã€ã¾ãšç°¡æ˜“çš„ãªã‚²ãƒ¼ãƒ ã‚¨ãƒ³ã‚¸ãƒ³ã®ã‚ˆã†ãªã‚‚ã®ã‚’ä½œã£ã¦ã€ã
pochi-mk 2017/12/05
ã‚€ãšã„ã€ã‘ã©é¢ç™½ãã†ã

ã‚²ãƒ¼ãƒ

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ

ãƒ‘ãƒ•ã‚©ãƒ¼ãƒžãƒ³ã‚¹

algorithm

å½“ãŸã‚Šåˆ¤å®š
ãƒªãƒ³ã‚¯
Microsoft PowerPoint - ppt-3.pptx
ãƒ†ãƒ¼ãƒžï¼“ï¼šå‡¸åŒ… å‡¸åŒ…ã®å®šç¾©ï¼Œæ§‹æˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ å‡¸åŒ…ã®å®šç¾© å‡¸åŒ…(convex hull)ã¨ã¯ï¼Œ ä¸Žãˆã‚‰ã‚ŒãŸç‚¹ã‚’ã™ã¹ã¦åŒ…å«ã™ã‚‹æœ€å°ã®å‡¸å¤šè§’å½¢ï¼ˆå‡¸å¤šé¢ä½“ï¼‰ã®ã“ã¨ï¼Ž å‡¸åŒ…ã®å®šç¾© å‡¸åŒ…(convex hull)ã¨ã¯ï¼Œ ä¸Žãˆã‚‰ã‚ŒãŸç‚¹ã‚’ã™ã¹ã¦åŒ…å«ã™ã‚‹æœ€å°ã®å‡¸å¤šè§’å½¢ï¼ˆå‡¸å¤šé¢ä½“ï¼‰ã®ã“ã¨ï¼Ž ï¼‘ç‚¹ãšã¤åŠ ãˆã¦è¡Œãï¼Ž ç¾åœ¨ã®å‡¸åŒ…ã®å†…éƒ¨ã®ç‚¹ãªã‚‰ ä½•ã‚‚ã—ãªã„ï¼Ž ç¾åœ¨ã®å‡¸åŒ…ã®å¤–éƒ¨ã®ç‚¹ãªã‚‰ ãã®ç‚¹ã‹ã‚‰å‡¸åŒ…ã«æŽ¥ç·šã‚’ã²ãï¼Œ å‡¸åŒ…ã‚’ä¿®æ£ã™ã‚‹ï¼Ž å•é¡Œï¼‘ï¼šå‡¸åŒ…ã®å†…éƒ¨/å¤–éƒ¨ã®åˆ¤å®šæ–¹æ³• å•é¡Œï¼’ï¼šå‡¸åŒ…ã¸ã®æŽ¥ç·šã®æ±‚ã‚æ–¹ å‡¸åŒ…ã®å®šç¾© å‡¸åŒ…(convex hull)ã¨ã¯ï¼Œ ä¸Žãˆã‚‰ã‚ŒãŸç‚¹ã‚’ã™ã¹ã¦åŒ…å«ã™ã‚‹æœ€å°ã®å‡¸å¤šè§’å½¢ï¼ˆå‡¸å¤šé¢ä½“ï¼‰ã®ã“ã¨ï¼Ž å…¨ã¦ã®ç‚¹ã‚’å«ã‚€æœ€å°ã®è»¸å¹³è¡Œ é•·æ–¹å½¢ã‹ã‚‰å§‹ã‚ï¼Œã“ã“ã‹ã‚‰å‰Šã£ã¦ã„ãï¼Ž ã¡ã‚‡ã†ã©è‰¯ã„ å‰Šã‚Šã™ãŽ å‰Šã‚Šã™ãŽãŸåˆ†ã‚’ã©ã®ã‚ˆã†ã« å¾©å…ƒã™ã‚‹ã‹ï¼Ÿ å‡¸åŒ…æ§‹æˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ (1) å‡¸åŒ…ã®åŸºæœ¬çš„ãªæ€§è³ªï¼‘ï¼š å¹³é¢ä¸Šã®ç‚¹é›†åˆSã®å‡¸åŒ…ã®é ‚ç‚¹
pochi-mk 2015/07/14
å‡¸åŒ…

algorithm
ãƒªãƒ³ã‚¯
Clojureã§å¦ã¶ãƒ‡ãƒ¼ã‚¿æ§‹é€ ï¼šãƒãƒƒã‚·ãƒ¥ãƒ†ãƒ¼ãƒ–ãƒ« - HackerNewsç¿»è¨³ã—ã¦ã¿ãŸ
ã€ŒHackerNewsç¿»è¨³ã—ã¦ã¿ãŸã€ãŒ POSTD (ãƒã‚¹ãƒˆãƒ»ãƒ‡ã‚£ãƒ¼) ã¨ã—ã¦ãƒªãƒ‹ãƒ¥ãƒ¼ã‚¢ãƒ«ã—ã¾ã—ãŸï¼ã“ã®è¨˜äº‹ã¯ã“ã“ã§ã‚‚å…¬é–‹ã•ã‚Œã¦ã„ã¾ã™ã€‚ ä»Šå›žã®è¨˜äº‹ã¯ã€Clojureã§ã®ãƒãƒƒã‚·ãƒ¥ãƒ†ãƒ¼ãƒ–ãƒ«ã®å®Ÿè£…ã«é–¢ã™ã‚‹è¨˜äº‹ã§ã™ã€‚é•·ã„è¨˜äº‹ã§é€”ä¸ã¾ã§ã®ç¿»è¨³ã«ãªã‚Šã¾ã™ãŒãŠæ¥½ã—ã¿ãã ã•ã„ã€‚ Original article: Data Structures in Clojure: Hash Tables by Max Countryman å‰å›žã®ãŠã•ã‚‰ã„ å‰å›žã®è¨˜äº‹ã§ã¯é€£çµãƒªã‚¹ãƒˆã«ã¤ã„ã¦ãŠè©±ã—ã—ã¾ã—ãŸã€‚å…·ä½“çš„ã«ã¯ã€ãƒŸãƒ¥ãƒ¼ã‚¿ãƒ–ãƒ«ãªç‰‡æ–¹å‘ãƒªã‚¹ãƒˆã®å®Ÿè£…æ–¹æ³•ã‚’æ¤œè¨¼ã—ã¾ã—ãŸãã€‚ç‰‡æ–¹å‘ãƒªã‚¹ãƒˆã‚’é¸ã‚“ã ç†ç”±ã«ã¤ã„ã¦ã‚‚ã€ã™ã§ã«èª¬æ˜Žæ¸ˆã¿ã§ã™ã€‚ã“ã“ã§è¦šãˆã¦ãŠã„ã¦ã»ã—ã„ã®ã¯ã€ä¸€èˆ¬çš„ã«Clojureã§ã¯ã‚¤ãƒŸãƒ¥ãƒ¼ã‚¿ãƒ–ãƒ«ãªãƒ‡ãƒ¼ã‚¿æ§‹é€ ãŒç”¨ã„ã‚‰ã‚Œã‚‹ã¨ã„ã†ã“ã¨ã§ã™ã€‚ã—ã‹ã—ãƒŸãƒ¥ãƒ¼ã‚¿ãƒ–ãƒ«ãªãƒ‡ãƒ¼ã‚¿æ§‹é€ ã‚’åˆ©ç”¨ã—ãŸæ–¹ãŒã€ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŒã‚ˆã‚Šã‚·ãƒ³ãƒ—ãƒ«ã§é«˜é€Ÿã«ãªã‚‹ã‚±
pochi-mk 2014/04/16
Clojure

algorithm

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

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
ã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿ã‚’é€²åŒ–ã•ã›ã¦ããŸå‰å¤§ãªã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¾ã¨ã‚
By Kai Schreiber IT æŠ€è¡“ã®é€²åŒ–ã®ã‚¹ãƒ”ãƒ¼ãƒ‰ã«ã¯ç›®ã‚’è¦‹å¼µã‚‹ã‚‚ã®ãŒã‚ã‚Šã¾ã™ãŒã€ãã‚Œã‚’æ”¯ãˆã¦ã„ã‚‹ã®ã¯ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¨å‘¼ã°ã‚Œã‚‹å‡¦ç†æ–¹æ³•(æŠ€è¡“çš„ã‚¢ã‚¤ãƒ‡ã‚¢)ã§ã™ã€‚ã•ã¾ã–ã¾ãªã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®ä¸ã§ã‚‚ã€ã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿ã®é€²åŒ–ã«é©å‘½çš„ãªå½±éŸ¿ã‚’ã‚‚ãŸã‚‰ã—ãŸã¨ã•ã‚Œã‚‹å‰å¤§ãªã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯ä»¥ä¸‹ã®é€šã‚Šã§ã™ã€‚ Great Algorithms that Revolutionized Computing http://en.docsity.com/news/interesting-facts/great-algorithms-revolutionized-computing/ â—†ãƒãƒ•ãƒžãƒ³ç¬¦å·(åœ§ç¸®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ) Huffman coding(ãƒãƒ•ãƒžãƒ³ç¬¦å·)ã¯ã€1951å¹´ã«ãƒ‡ãƒ¼ãƒ“ãƒƒãƒ‰ãƒ»ãƒãƒ•ãƒžãƒ³æ°ã«ã‚ˆã£ã¦é–‹ç™ºã•ã‚ŒãŸã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã€‚é »å‡ºé »åº¦ã®å¤§å°ã«ã‚ˆã£ã¦å¯¾æˆ¦ã™ã‚‹ãƒˆãƒ¼ãƒŠãƒ¡ãƒ³ãƒˆãƒ„ãƒªãƒ¼ã‚’è€ƒãˆã¦ã€ãƒ–ãƒãƒƒã‚¯ã”ã¨ã«0ã¨1ã®ç¬¦å·ã‚’ã‚‚ãŸã›ã‚‹
pochi-mk 2014/03/12
ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®å‹‰å¼·ã£ã¦æ¥½ã—ã„ã‚ˆãã€‚

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ

algorithm

PC
ãƒªãƒ³ã‚¯
è¨ˆç®—é‡ã®ã¯ãªã— - èµ¤ã„é»’æ´å²ã‚’è“„ç©ã™ã‚‹
ã©ã†ã‚‚è¯éº—ãªã‚‹ã‚ãƒ£ãƒƒãƒ„ãƒ‘ãƒ¼ã§ã™ã€‚ã‚ãƒ£ãƒƒãƒˆã‚¢ãƒƒãƒ‘ãƒ¼ã§ã™ã€‚ ã“ã®è¨˜äº‹ã¯Competitive Programming Advent Calendar Div2013, 12/7ã®è¨˜äº‹ã§ã™ã€‚ ç§ã¯éŽåŽ»ã«ã€æš‡ã«ä»»ã›ã¦ã“ã®ã‚ˆã†ãªã‚¹ãƒ©ã‚¤ãƒ‰ã‚’ä½œã£ã¦ã—ã¾ã„ã¾ã—ãŸã€‚ æœ‰åã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¨ãã‚Œã®è¨ˆç®—é‡ã«ã¤ã„ã¦åˆ—æŒ™ã™ã‚‹ã®ãŒæ¥½ã—ã™ãŽã¦ä½œã£ã¦ã—ã¾ã„ã¾ã—ãŸã€‚å¾Œæ‚”ã—ã¦ãŠã‚Šã¾ã™ã€‚ æœ¬è¨˜äº‹ã§ã¯ã€Œè¨ˆç®—é‡ã£ã¦ã©ã†ã‚„ã£ã¦è¨ˆç®—ã™ã‚‹ã®ï¼Ÿã€ã¿ãŸã„ãªè©±ã‚’ç«¶ãƒ—ãƒã®è¦³ç‚¹ã‹ã‚‰ã—ã¾ã™ã€‚ è¨ˆç®—é‡ã¨ã¯ãªã‚“ãžã‚„ã¨ã„ã†ã“ã¨ã«ã¤ã„ã¦ã¯ä¸Šã®ã‚¹ãƒ©ã‚¤ãƒ‰ã‚’èªã‚“ã§ãã ã•ã„ã€‚ è¨ˆç®—é‡ã®ç¨®é¡ž ç«¶æŠ€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã§æ°—ã«ã™ã‚‹è¨ˆç®—é‡ã¯2ç¨®é¡žã‚ã‚Šã¾ã™ã€‚æœ€æ‚ªè¨ˆç®—é‡ã¨å„Ÿå´è¨ˆç®—é‡ã§ã™ã€‚ æœ€æ‚ªè¨ˆç®—é‡ã¨ã„ã†ã®ã¯ã€ã‚ã‚‹å‡¦ç†ã«ã©ã®ã‚ˆã†ãªå…¥åŠ›ã‚’ä¸Žãˆã¦ã‚‚ã€ãã‚Œä»¥ä¸Šã«é€Ÿã„è¨ˆç®—é‡ã«ãªã‚‹ã€ã¨ã„ã†ã‚‚ã®ã§ã€ä¸€ç¨®ã®ä¸Šç•Œã§ã™ã€‚ç«¶æŠ€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã§ã¯ä½œå•è€…ãŒæœ€æ‚ªè¨ˆç®—é‡ã«ãªã‚‹ãƒ†ã‚¹ãƒˆã‚±ãƒ¼ã‚¹ã‚’ã‹ãªã‚‰ãšå…¥ã‚Œã¦ãã¾ã™ã‹ã‚‰
pochi-mk 2014/01/03
ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ

programming

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

æ•°å¦

algorithm

CompetitiveProgramming
ãƒªãƒ³ã‚¯
ãƒžãƒ«ãƒã‚³ã‚¢æ™‚ä»£ã®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.
pochi-mk 2013/11/25
algorithm

multithread

lockfree

c++

programming

presentation
ãƒªãƒ³ã‚¯
1