STMã®è¨è¨ˆã¨é€²åŒ–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.
æ ªå¼ä¼šç¤¾ãƒãƒ³ã‚°ã‚²ãƒ¼ãƒˆ - プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®é”導書 ～Programmers’ Grimoire～ vol.3
プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®é”導書 〜Programmers' Grimoire〜 Vol.3 “Parallel, Concurrent, and Distributed Programming†並行世界ã®é”物ã«äººé¡žã¯ã©ã†ç«‹ã¡å‘ã‹ã†ã®ã‹ã€‚ 目次(カッコ内ã«æ•°å—ã®ã‚る記事åã«ã¤ã„ã¦ã¯ã‚µãƒ³ãƒ—ルをã”覧ã„ãŸã ã‘ã¾ã™) åºæ–‡ 熊崎 å®æ¨¹ Lock-free入門 (1 2) 熊崎 å®æ¨¹ OpenACC 藤田 典久 Erlangã¨Scalaã«ãŠã‘るアクターモデルã®ç´¹ä»‹ (1 2) 幾田 é›…ä» C#ã®éžåŒæœŸå‡¦ç† 岩永 信之 Real World STM ～作ã£ã¦å¦ã¶STM～ 石井 大海 データ並列ã¸ã®æ‹›å¾… (1 2) shelarcy åˆæˆå¯èƒ½ãªãƒ¡ãƒƒã‚»ãƒ¼ã‚¸ãƒ‘ッシング ～Concurrent ML ã®ç´¹ä»‹ï½ž å°ç¬ 原 å•“ コルーãƒãƒ³ã‚¹ã‚¿ã‚¤ãƒ«ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚° 高橋 晶 ç”»åƒæ¤œç´¢å…¥é–€ miyabiarts 購入 PDF 版
Locks, Actors, And Stm In Pictures - adit.io
Written May 15, 2013 All programs with concurrency have the same problem. Your program uses some memory: When your code is single-threaded, there's just one thread writing to memory. You are A-OK: But if you have more than one thread, they could overwrite each others changes! You have three ways of dealing with this problem: Locks Actors Software Transactional Memory I'll solve a classic concurren
Non-blocking STMã«ã¤ã„ã¦é ‘å¼µã£ã¦èª¬æ˜Žã—ã¦ã¿ã‚‹ - ãã¾ãƒ¡ãƒ¢
STMã¯ã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ãƒˆãƒ©ãƒ³ã‚¶ã‚¯ã‚·ãƒ§ãƒŠãƒ«ãƒ¡ãƒ¢ãƒªã®ç•¥ã§ã™ã€‚ ↓ã¨ã‚Šã‚ãˆãšwikipedia http://ja.wikipedia.org/wiki/%E3%82%BD%E3%83%95%E3%83%88%E3%82%A6%E3%82%A7%E3%82%A2%E3%83%88%E3%83%A9%E3%83%B3%E3%82%B6%E3%82%AF%E3%82%B7%E3%83%A7%E3%83%8A%E3%83%AB%E3%83%A1%E3%83%A2%E3%83%AA 日本ã§STMã®è©±é¡Œã‚’検索ã™ã‚‹ã¨ã€Œæ¥½è¦³çš„ãƒãƒƒã‚¯ã§ã—ょ？ã€ã¨ã„ã£ãŸç™ºè¨€ã‚’見ã‹ã‘る事ãŒå¤šãã€ç¢ºã‹ã«å®Ÿç”¨çš„ãªæ‰‹æ³•ã®å¤šãã¯ãƒãƒƒã‚¯ãƒ™ãƒ¼ã‚¹ã ã£ãŸã‚Šã—ã¦ã„ã¾ã™ãŒã€æ£ç›´ãªã¨ã“ã‚ãƒãƒƒã‚¯ãƒ™ãƒ¼ã‚¹ãªæ‰‹æ³•ã®STMã¯ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ã§ã®ãƒˆãƒ©ãƒ³ã‚¶ã‚¯ã‚·ãƒ§ãƒ³ã¨ä¼¼ã¦ã„るフシãŒã‚ã£ãŸã‚Šã—ã¦ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ã«è©³ã—ã„人ã‹ã‚‰ã™ã‚‹ã¨ãã‚Œã»ã©é©šãよã†ãªæ‰‹æ³•ã§ã¯ãªã„事ãŒå¤šã„ã®ã§ã™ã€‚ãã®
モダン並列・並行プãƒã‚°ãƒ©ãƒŸãƒ³ã‚° ～ Concurrent Revisions ã«ã‚ˆã‚‹å®Ÿè£…ã¨ç¾å®Ÿ ～ - Preferred Networks Research & Development
本日社内å‘ã‘ã®TechTalkã«ã¦ã€ä¸¦åˆ—・並行プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã«é–¢ã™ã‚‹è©±ã‚’è¡Œã„ã¾ã—ãŸã€‚ 昨今ã€ãƒ—ãƒã‚°ãƒ©ãƒ ã®ä¸¦åˆ—化ã¯ãªãã¦ã¯ãªã‚‰ãªã„ã‚‚ã®ã¨ãªã£ã¦ã„ã¾ã™ã€‚ã—ã‹ã—ã€ãã®ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ç’°å¢ƒã¯ä¾ç„¶ã¨ã—ã¦ãƒãƒƒã‚¯ã‚’用ã„ãŸã‚‚ã®ãŒä¸»æµã§ã™ã€‚今回ã®ç™ºè¡¨ã®ä¸»å¼µã‚’端的ã«ç”³ã—上ã’ã¾ã™ã¨ã€ “Locks must goï¼â€ ã¨ã„ã†ã“ã¨ã«ãªã‚Šã¾ã™ã€‚並列プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã«éŠ€ã®å¼¾ä¸¸ã¯ã‚ã‚Šã¾ã›ã‚“。ã—ã‹ã—ã€ãƒãƒƒã‚¯ã¯åˆ¥ã®ä½•ã‚‰ã‹ã®å®‰å…¨æ€§ã‚’確ä¿ã—ãŸãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ãƒ¢ãƒ‡ãƒ«ã§ç½®ãæ›ãˆã‚‰ã‚Œãªã‘ã‚Œã°ã„ã‘ã¾ã›ã‚“。ãã†ã§ãªã‘ã‚Œã°ã€å†ç¾ã—ã«ãã„ãƒã‚°ã«è‹¦ã—ã‚られã€çµ‚電を逃ã™æ—¥ã€…ã¨æ±ºåˆ¥ã™ã‚‹ã“ã¨ã¯ã§ããªã„ã§ã—ょã†ã€‚ã¾ãŸã€ãƒãƒƒã‚¯ã«ã‚ˆã‚‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®æŠ±ãˆã‚‹æœ¬è³ªçš„å•é¡Œã«ã‚‚言åŠã—ã¦ã„ã¾ã™ã€‚ ã“ã®ç•Œéšˆã®æœ€æ–°ã®å‹•å‘ã¨ã—ã¦ã€åŽ»å¹´OOPSLA’10ã«ã¦ç™ºè¡¨ã•ã‚ŒãŸConcurrent Revisionsã«ã¤ã„ã¦ã®è§£èª¬ã‚‚è¡Œãªã£ã¦ãŠã‚Šã¾ã™ã€‚ã¾ãŸã€å¼Šç¤¾ç ”究開発ã«ãŠã„ã¦ã€å…ˆæ—¥Con
1
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
æ‘上春樹風ã«lock-freeã«ã¤ã„ã¦èªžã‚‹ã‚¹ãƒ¬
{{#tags}}- {{label}}
{{/tags}}