[B! GC] agxã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

agx id:agx

GCã«é–¢ã™ã‚‹agxã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (6)

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

è¦–è¦šåŒ–ã«ã‚ˆã‚‹5ã¤ã®ã‚¬ãƒ™ãƒ¼ã‚¸ã‚³ãƒ¬ã‚¯ã‚·ãƒ§ãƒ³ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ å…¥é–€ | POSTD
ã»ã¨ã‚“ã©ã®é–‹ç™ºè€…ã¯ã€è‡ªå‹•ã®ã‚¬ãƒ™ãƒ¼ã‚¸ã‚³ãƒ¬ã‚¯ã‚·ãƒ§ãƒ³ï¼ˆGCï¼‰ã‚’å½“ãŸã‚Šå‰ã®ã‚ˆã†ã«ä½¿ã£ã¦ã„ã¾ã™ã€‚ã“ã‚Œã¯ã€ç§ãŸã¡ã®ä»•äº‹ã‚’å®¹æ˜“ã«ã™ã‚‹ãŸã‚ã«è¨€èªžãƒ©ãƒ³ã‚¿ã‚¤ãƒ ãŒæä¾›ã™ã‚‹ç´ æ™´ã‚‰ã—ã„æ©Ÿèƒ½ã®1ã¤ã§ã™ã€‚ ã—ã‹ã—ã€æœ€æ–°ã®ã‚¬ãƒ™ãƒ¼ã‚¸ã‚³ãƒ¬ã‚¯ã‚¿ã®ä¸ã‚’ã®ãžã„ã¦ã¿ã‚Œã°ã€å®Ÿéš›ã®ä»•çµ„ã¿ã¯éžå¸¸ã«ç†è§£ã—ã¥ã‚‰ã„ã“ã¨ãŒåˆ†ã‹ã‚Šã¾ã™ã€‚å®Ÿè£…ã®è©³ç´°ãŒç„¡æ•°ã«ã‚ã‚‹ãŸã‚ã€ãã‚ŒãŒä½•ã‚’ã—ã‚ˆã†ã¨ã—ã¦ã„ã‚‹ã®ã‹ã€ã¾ãŸã€ãã‚ŒãŒã¨ã‚“ã§ã‚‚ãªãé–“é•ã£ãŸäº‹æ…‹ã‚’å¼•ãèµ·ã“ã—ã‹ããªã„ã“ã¨ã«ã¤ã„ã¦ååˆ†ç†è§£ã—ã¦ã„ãªã„é™ã‚Šã€ã™ã£ã‹ã‚Šæ··ä¹±ã—ã¦ã—ã¾ã†ã§ã—ã‚‡ã†ã€‚ ãã“ã§ã€5ç¨®é¡žã®ã‚¬ãƒ™ãƒ¼ã‚¸ã‚³ãƒ¬ã‚¯ã‚·ãƒ§ãƒ³ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’æŒã¤ãŠã‚‚ã¡ã‚ƒã‚’ä½œã£ã¦ã¿ã¾ã—ãŸã€‚å°ã•ã„ã‚¢ãƒ‹ãƒ¡ãƒ¼ã‚·ãƒ§ãƒ³ã¯ãƒ©ãƒ³ã‚¿ã‚¤ãƒ ã®å‹•ä½œã‹ã‚‰ä½œæˆã—ã¾ã—ãŸã€‚ã‚‚ã£ã¨å¤§ãã„ã‚¢ãƒ‹ãƒ¡ãƒ¼ã‚·ãƒ§ãƒ³ã¨ãã‚Œã‚’ä½œæˆã™ã‚‹ã‚³ãƒ¼ãƒ‰ã¯ github.com/kenfox/gc-viz ã§è¦‹ã‚‹ã“ã¨ãŒã§ãã¾ã™ã€‚å˜ç´”ãªã‚¢ãƒ‹ãƒ¡ãƒ¼ã‚·ãƒ§ãƒ³ã«ã‚ˆã£ã¦ã“ã†ã—ãŸé‡è¦ãªã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’æ˜Žã‚‰ã‹ã«ã§ãã‚‹ã“ã¨ã¯
agx 2014/11/20
GC

*programming

algorithm
ãƒªãƒ³ã‚¯
GCã®æœ€è¿‘ã®ãƒˆãƒ¬ãƒ³ãƒ‰ã£ã½ã„ã‚‚ã® - I am Cruby!
GCè‹±èªžè«–æ–‡Bacon01Concurrent.pdfä»Šèªã‚“ã§ã„ã‚‹æœ€ä¸ã€‚trasingGCã¨æ¬ ã‘åˆã‚ã•ã£ã¦ã„ã¦ã¨ã¦ã‚‚èˆˆå‘³æ·±ã„ä¸€å“ã€‚é¢ç™½ã„ã®ã§èªã‚“ã§ãŠãä¾¡å€¤ã‚ã‚Šã€€04-g1-paper-ismm.pdf JavaGCã®ä¸€ã¤ã®æ©Ÿèƒ½ã®æ–°ã—ã„ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã ã¨ã‹ã€‚Garbage First Garbage Collection(G1GC)ã ãã†ãªã€‚è©³ã—ãèªã‚“ã§ãªã„ã®ã§ã¾ã ã‚ã‹ã‚“ãªã„ã€‚trainGCã«é¡žä¼¼ã—ã¦ã‚‹ãã†ãªã€‚ã¨ã„ã†ã“ã¨ã¯remenbersetãŒã†ã‚“ã¬ã‚“ã‹ã‚“ã¬ã‚“ã€‚ã€€HnxGCHnxGC-Accurate (Precise), Pauseless & Deterministic Garbage Collection C++ãŸã¶ã‚“ä¸Šã®ã‚’å®Ÿéš›ã«å®Ÿè£…ã—ã¦ã‚‹ã‚“ã ã¨æ€ã†ã€‚OpenSourceã˜ã‚ƒãªã„ã®ã§ã‚ã‹ã‚“ãªã„ã‘ã©ã€ãã‚“ãªé›°å›²æ°—ã ã£ãŸã€‚C++ã®GCãƒ©ã‚¤ãƒ–ãƒ©ãƒªã ãã†ã ã€‚ã€€å¸¸è˜ã ã‘ã©ãƒˆãƒ¬ãƒ³ãƒ‰ã‚’çŸ¥ã‚ŠãŸã„äººã¯Re
agx 2008/04/06
GC
ãƒªãƒ³ã‚¯
[å®Ÿè£…ç·¨]ãƒ¡ãƒ¢ãƒªãƒ¼ç®¡ç†ã‚’å‡¦ç†ç³»ä»»ã›ã«ã—ã¦ã¯ã„ã‘ãªã„
Javaã‚„.NETã‚’ä½¿ã†ã¨ï¼Œãƒ¡ãƒ¢ãƒªãƒ¼ç®¡ç†ã‚’æ„è˜ã—ãªãã¦ã‚‚ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã§ãã‚‹ã€‚ä¾‹ãˆã°Javaã®å ´åˆã¯ï¼ŒJava VMï¼ˆVirtual Machineï¼‰ãŒå‚™ãˆã‚‹ã€Œã‚¬ãƒ™ãƒ¼ã‚¸ãƒ»ã‚³ãƒ¬ã‚¯ã‚¿ã€ã¨å‘¼ã¶ãƒ¡ãƒ¢ãƒªãƒ¼ç®¡ç†æ©Ÿèƒ½ãŒï¼Œæœªä½¿ç”¨ã®ã‚ªãƒ–ã‚¸ã‚§ã‚¯ãƒˆã‚’ç ´æ£„ã—ã¦ãƒ¡ãƒ¢ãƒªãƒ¼ã‚’è§£æ”¾ã™ã‚‹ã¨ã„ã£ãŸå‡¦ç†ã‚’è‡ªå‹•çš„ã«å®Ÿè¡Œã™ã‚‹ï¼ˆå›³1ï¼‰ã€‚ å›³1â—JavaVMã«ã‚ˆã‚‹ãƒ¡ãƒ¢ãƒªãƒ¼ç®¡ç†ã®ä»•çµ„ã¿ ãƒ’ãƒ¼ãƒ—é ˜åŸŸã¯ï¼Œç”Ÿå˜æœŸé–“ã®çŸã„ã‚ªãƒ–ã‚¸ã‚§ã‚¯ãƒˆã‚’æ ¼ç´ã™ã‚‹ã€ŒNewé ˜åŸŸã€ã¨ç”Ÿå˜æœŸé–“ã®é•·ã„ã‚ªãƒ–ã‚¸ã‚§ã‚¯ãƒˆã‚’æ ¼ç´ã™ã‚‹ã€ŒOldé ˜åŸŸã€ã§æ§‹æˆã•ã‚Œã‚‹ã€‚Newé ˜åŸŸã¯ã•ã‚‰ã«ï¼Œæœ€åˆã«ã‚ªãƒ–ã‚¸ã‚§ã‚¯ãƒˆã‚’æ ¼ç´ã™ã‚‹é ˜åŸŸã€ŒEdenã€ã¨ï¼Œã—ã°ã‚‰ãç”Ÿå˜ã—ã¦ã„ã‚‹ã‚ªãƒ–ã‚¸ã‚§ã‚¯ãƒˆã‚’æ ¼ç´ã™ã‚‹ã€Œä¸–ä»£0ã€ã€Œä¸–ä»£1ã€ã‹ã‚‰æˆã‚‹ã€‚Edenã«å˜åœ¨ã™ã‚‹ã‚ªãƒ–ã‚¸ã‚§ã‚¯ãƒˆã¯ï¼Œç”Ÿå˜æœŸé–“ãŒå»¶ã³ã‚‹ã«ã¤ã‚Œã¦ï¼Œä¸–ä»£0ã¾ãŸã¯ä¸–ä»£1ã«ç§»å‹•ã€‚ä¸–ä»£0ã¨ä¸–ä»£1ã‚’ä½•åº¦ã‹ç§»å‹•ã—ãŸå¾Œï¼Œæœ€çµ‚çš„ã«Oldé ˜åŸŸã«ç§»ã•ã‚Œã‚‹ [ç”»åƒã®ã‚¯ãƒªãƒƒã‚¯ã§æ‹¡å¤§è¡¨ç¤º] ã ãŒï¼Œå‡¦
agx 2008/04/05
ä¸–ä»£åˆ¥GCã®èª¬æ˜Ž

java

GC
ãƒªãƒ³ã‚¯
Some more advanced GC techniques
After my last two posts about garbage collection, some people people suggested some more advanced techniques be used to solve the pausing probl em. Here's a quick* overview of some more advanced techniques, some of which can eliminate noticeable pauses and some of which can solve other probl ems in GC. The train algorithm The idea of the train algorithm is to break the heap (or, really, just the old
agx 2008/04/04
GC ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã„ã‚ã„ã‚

algorithm

GC
ãƒªãƒ³ã‚¯
Garbage Collection - Seminars - Langphilia!
{Richard Jones, Rafael Lins}, GARBAGE COLLECTION Algorithms for Automatic Dynamic Memory Management. John Wiley & Sons Ltd, 1996. ï¼ˆè¨³æ³¨ï¼‰ ã“ã®ãƒšãƒ¼ã‚¸ã¯ã€ä¸Šè¨˜ã®æœ¬ã®ç¬¬1ç« ã¾ã§ã‚’ã¦ãã¨ãƒ¼ã«è¨³ã—ãŸã‚‚ã®ã§ã™ã€‚ åŽŸæ–‡ã®è‘—ä½œæ¨©ã¯ã€åŽŸè‘—è€…ã«ã‚ã‚Šã¾ã™ã€‚ã“ã®ãƒšãƒ¼ã‚¸ã®è‘—ä½œæ¨©ã¯ç§ã«ã‚ã‚Šã¾ã™ã€‚ ç¿»è¨³è¨±å¯ã¯ã‚‚ã‚‰ã£ã¦ã„ã¾ã›ã‚“ã€‚ å‰æ›¸ã (Preface) ã“ã®æœ¬ã¯GCã®æœ¬ã§ã™ã€‚ GCã¨ã¯ã€ãƒ—ãƒã‚°ãƒ©ãƒ ãŒåˆ©ç”¨ã—çµ‚ã‚ã£ãŸãƒ’ãƒ¼ãƒ—é ˜åŸŸã‚’è‡ªå‹•çš„ã«å›žåŽã™ã‚‹ã‚‚ã®ã§ã™ã€‚ æ˜”ã‚‚ä»Šã‚‚ã€ãƒ¡ãƒ¢ãƒªã¯é™ã‚‰ã‚ŒãŸè²´é‡ãªè³‡æºã§ã™ã€‚ ã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿ã®åˆæœŸã€VLSIãŒç¾ã‚Œã‚‹ã¾ã§ãƒ¡ãƒ¢ãƒªã¯é«˜ä¾¡ã§ã€ Unixã®ã‚ˆã†ãªæ™‚åˆ†å‰²OSã§ã‚‚ãŸã£ãŸ64KBã®ã‚»ã‚°ãƒ¡ãƒ³ãƒˆ1ã¤ã§å‹•ãã“ã¨ãŒæœ›ã¾ã‚Œã¾ã—ãŸã€‚ ä»Šæ—¥ã€SIMMã¯æ¯”è¼ƒçš„å®‰ä¾¡ã§ã‚¤ãƒ³ã‚¹ãƒˆãƒ¼ãƒ«ã‚‚ç°¡å˜ã§
agx 2007/11/02
GARBAGE COLLECTION Algorithms for Automatic Dynamic Memory Management ã®ç¬¬1ç« ã¾ã§ã‚’ã¦ãã¨ãƒ¼ã«è¨³ã—ãŸã‚‚ã®ã§ã™ã€‚

GC
ãƒªãƒ³ã‚¯
Mostly-Concurrent Mark & Sweep GC ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ç›®æ¬¡ 1. å‰ç½®ã 2. HotSpot VM 1.4.x ã® GC ã®ç¨®é¡ž 3. Mostly-concurrent Mark & Sweep 4. å¿œç”¨ 4.1 ä¸–ä»£åˆ¥ GC ã¨ã®çµ„ã¿åˆã‚ã› 4.2 ã‚«ãƒ¼ãƒ‰ãƒžãƒ¼ã‚ãƒ³ã‚° (Card Marking) 4.3 ä¸¦åˆ—åŒ– (Parallel GC) 4.4 ãƒ“ãƒƒãƒˆãƒ¯ã‚¤ã‚ºãƒ»ã‚¹ã‚¤ãƒ¼ãƒ— (Bitwise Sweep) 4.5 ã‚¤ãƒ³ã‚¯ãƒªãƒ¡ãƒ³ã‚¿ãƒ«ãƒ»ã‚³ãƒ³ãƒ‘ã‚¯ã‚·ãƒ§ãƒ³ (Incremental Compaction) 5. å‚è€ƒæ–‡çŒ® è„šæ³¨ ã‚³ãƒ¡ãƒ³ãƒˆ 1. èƒŒæ™¯ ã‚¬ãƒ¼ãƒ™ãƒ¼ã‚¸ã‚³ãƒ¬ã‚¯ã‚·ãƒ§ãƒ³(GC) ã«ã¯è‰²ã€…ãªã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŒå˜åœ¨ã™ã‚‹ãŒã€å¤§é›‘æŠŠã«è¨€ã£ã¦ Stop-the-World (STW) åž‹ GC ã¨ On-the-fly åž‹ GC ã«å¤§åˆ¥ã•ã‚Œã‚‹ã€‚ STW åž‹ã® GC ã¯ãƒ—ãƒã‚°ãƒ©ãƒ ã®å®Ÿè¡Œä¸ã«ã¯ã‚¬ãƒ¼ãƒ™ãƒ¼ã‚¸ã®å›žåŽã‚’è¡Œã‚ãšã€ãƒ¡ãƒ¢ãƒªãŒæž¯æ¸‡ã—ãŸæ™‚ã«ãªã£ã¦å§‹ã‚ã¦ã‚¬ãƒ¼ãƒ™ãƒ¼ã‚¸ã®å›ž
agx 2007/11/01
Java ã®GCã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ

algorithm

GC

Java
ãƒªãƒ³ã‚¯
1