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.
GHC STM Notes
Note: this document now lives here Introduction This document give an overview of the runtime system (RTS) support for GHC's STM implementation. We will focus on the case where fine grain locking is used (STM_FG_LOCKS). Some details about the implementation can be found in the papers "Composable Memory Transactions" and "Transactional memory with data invariants". Additional details can be found i
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ã¯ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ã§ã®ãƒˆãƒ©ãƒ³ã‚¶ã‚¯ã‚·ãƒ§ãƒ³ã¨ä¼¼ã¦ã„るフシãŒã‚ã£ãŸã‚Šã—ã¦ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ã«è©³ã—ã„人ã‹ã‚‰ã™ã‚‹ã¨ãã‚Œã»ã©é©šãよã†ãªæ‰‹æ³•ã§ã¯ãªã„事ãŒå¤šã„ã®ã§ã™ã€‚ãã®
Haskellã®ã‚¹ãƒ¬ãƒƒãƒ‰ã‚·ã‚¹ãƒ†ãƒ ã¨STMã«ã¤ã„㦠ãã®1 — ã‚ã‚Šãˆã‚‹ãˆã‚Šã‚
æ¦‚è¦ Haskellã®ã‚¹ãƒ¬ãƒƒãƒ‰ã‚·ã‚¹ãƒ†ãƒ ã¨STMã«ã¤ã„ã¦èª¿ã¹ãŸã®ã§ã€ã“ã“ã«ã¾ã¨ã‚ã¾ã™ã€‚ Haskellã®ã‚¹ãƒ¬ãƒƒãƒ‰ã‚·ã‚¹ãƒ†ãƒ ã¯ã€äºˆæƒ³ã‚ˆã‚Šã‚‚複雑ã§ã—ãŸã€‚ Haskellã®ä¸–ç•Œã§é–‰ã˜ãŸå‡¦ç†ãªã‚‰ã°ã€æ¯”較的簡å˜ãªã®ã§ã™ãŒã€ FFI(Foreign Function Interface: 外部ã®Cã®é–¢æ•°ã‚’呼ã³å‡ºã™ä»•çµ„ã¿)を使ã†ã¨ã€ ã¨ãŸã‚“ã«è¤‡é›‘ã«ãªã£ã¦ã—ã¾ã„ã¾ã™ã€‚ 一度ã«æ›¸ãã¨ã€é‡ãŒå¤šã„ãŸã‚ã€æ•°å›žã«åˆ†ã‘ã¦æ›¸ã“ã†ã¨æ€ã£ã¦ã„ã¾ã™ã€‚
1
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
処ç†ã‚’実行ä¸ã§ã™
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
Concurrency – Haskell Prime
{{#tags}}- {{label}}
{{/tags}}