[B! memory] moozã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

mooz id:mooz

memoryã«é–¢ã™ã‚‹moozã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (25)

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

RecSys2013ã®BestPaperã‚’èªã‚€_Fast_Parallel_SGD - åˆ†ã‹ã‚‰ã‚“ã“ã¨å¤šã™ãŽ
RecSys 2013 (Hong Kong) - RecSysã®best paperãŒã€ãªã‚“ã ã‹é¢ç™½ãã†ã ã£ãŸã®ã§èªã‚€ã€‚ A Fast Parallel SGD for Matrix Factorization in Shared Memory Systems è‘—ï¼šYong Zhuang, Wei-Sheng Chin, Yu-Chin Juan, and Chih-Jen Lin æœ¬è«–æ–‡è‡ªä½“ã¯ã€Matrix Factorizationã®ãŸã‚ã®SGDã®æ‹¡å¼µã§ã‚ã‚‹ç‚¹ãŒã€ä»–ã®è«–æ–‡ã¨ã¯é•ã†ã‚‰ã—ã„ã€‚ åºè«–ã¯ç¢ºçŽ‡çš„å‹¾é…é™ä¸‹æ³•ï¼ˆSGDï¼‰ã®ä¸¦åˆ—åŒ–ã«ã¤ã„ã¦ - åˆ†ã‹ã‚‰ã‚“ã“ã¨å¤šã™ãŽã«æ›¸ã„ãŸã®ã§ã€æœ¬æ–‡ã®3ç« ï¼ˆSGDã®ä¸¦åˆ—åŒ–ã«é–¢ã™ã‚‹è«¸å•é¡Œï¼‰ã‹ã‚‰ã«ãªã‚‹ã€‚ ã¾ãŸçµè«–ã‹ã‚‰è¨€ã†ã¨ã€è¨ˆç®—é€Ÿåº¦ã¯å¾“æ¥æ‰‹æ³•ã®åå€ç¨‹åº¦ã«ãªã‚‹ã€‚ ãŸã ã—ã€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ä¸Šã®ãƒ†ã‚¯ãƒ‹ãƒƒã‚¯çš„ãªè©±ãªã®ã§ã€ç†è«–ã¨ã‹ã‚ã‚“ã¾ã‚Šãªã„ã€‚ å‹‰å¼·ã«ãªã‚‹ã—å®Ÿç”¨çš„ã§ã€ä¼æ¥
mooz 2015/11/16
machine_learning

optimization

memory
ãƒªãƒ³ã‚¯
Memory footprint - Wikipedia
This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources:Â "Memory footprint"Â â€“Â newsÂ Â· newspapersÂ Â· booksÂ Â· scholarÂ Â· JSTOR (July 2012) (Learn how and when to remove this message) Memory footprint refers to the amount of main memory that a program uses or referen
mooz 2014/06/20
ãƒ¡ãƒ¢ãƒªã®ä½¿ç”¨é‡

word

computer

memory
ãƒªãƒ³ã‚¯
Hekaton (database) - Wikipedia
mooz 2014/06/18
txn ã‚’ compile

database

oltp

memory

research
ãƒªãƒ³ã‚¯
ä¸ƒè»¢ã³å…«èµ·ãã®Linuxã‚«ãƒ¼ãƒãƒ«ã‚³ãƒŸãƒ¥ãƒ‹ãƒ†ã‚£é–‹ç™ºä½“é¨“è¨˜
ã¯ã˜ã‚ã« ç¾åœ¨ã®Linuxã‚«ãƒ¼ãƒãƒ«ã¯ãƒ¡ãƒ¢ãƒªãƒ¼ãƒ›ãƒƒãƒˆãƒ—ãƒ©ã‚°ã¨ã„ã†ï¼Œä¸€èˆ¬çš„ã«ã¯ãªã˜ã¿ãŒãªã„æ©Ÿèƒ½ã‚’ã‚µãƒãƒ¼ãƒˆã™ã‚‹ã‚ˆã†ã«ãªã£ã¦ã„ã¾ã™ã€‚ç§ã¯é•·ã„é–“ãã®é–‹ç™ºã«ã‹ã‹ã‚ã£ã¦ãã¾ã—ãŸã€‚ ã‚³ãƒŸãƒ¥ãƒ‹ãƒ†ã‚£ã«å‚åŠ ã™ã‚‹æ–¹æ³•ã¨ã„ã†ã®ã¯ï¼Œä»Šã§ã¯ãƒŽã‚¦ãƒã‚¦åŒ–ãŒé€²ã¿ï¼Œã€ŒLinuxã‚«ãƒ¼ãƒãƒ«é–‹ç™ºã¸ã®å‚åŠ æ–¹æ³•ã€ã¨ã„ã†æ–‡æ›¸ã‚‚ç´¹ä»‹ã•ã‚Œã‚‹ã‚ˆã†ã«ãªã‚Šã¾ã—ãŸã€‚ ã—ã‹ã—ï¼Œç§ãŒæ´»å‹•ã‚’ã¯ã˜ã‚ãŸå½“æ™‚ã¯ï¼Œã¾ã ã©ã†ã‚„ã£ã¦é–‹ç™ºã—ã¦ã„ã‘ã°ã‚ˆã„ã®ã‹å‹æ‰‹ãŒã‚ã‹ã‚‰ãšï¼Œå››è‹¦å…«è‹¦ã™ã‚‹ã“ã¨ã¨ãªã‚Šã¾ã—ãŸã€‚ã“ã‚Œã¾ã§ãƒ—ãƒãƒ—ãƒ©ã‚¨ã‚¿ãƒªãªã‚½ãƒ•ãƒˆé–‹ç™ºã—ã‹ã—ãŸã“ã¨ãŒãªã„ã‚¨ãƒ³ã‚¸ãƒ‹ã‚¢ã«ã¨ã£ã¦ï¼Œã‚³ãƒŸãƒ¥ãƒ‹ãƒ†ã‚£é–‹ç™ºã¨ã„ã†ã®ã¯ã¾ã£ãŸãé–‹ç™ºã‚¹ã‚¿ã‚¤ãƒ«ã®é•ã†ä¸–ç•Œã«é£›ã³è¾¼ã‚€ã“ã¨ã ã£ãŸã‹ã‚‰ã§ã™ã€‚ã—ã‹ã—ï¼Œãã®è‹¦åŠ´ã«ã‚ˆã£ã¦å¾—ã‚‰ã‚ŒãŸçµŒé¨“ã¯ï¼Œãã®å¾Œã®ä»–ã®é–‹ç™ºæ´»å‹•ã«æ´»ã‹ã•ã‚Œã‚‹ã“ã¨ã«ãªã‚Šã¾ã—ãŸã€‚ã¡ã‚‡ã†ã©è‰¯ã„æ©Ÿä¼šã‚’ã„ãŸã ã„ãŸã®ã§ï¼Œãã®ã¨ãã®è‹¦åŠ´ã‚’æŒ¯ã‚Šè¿”ã‚ŠãŸã„ã¨æ€ã„ã¾ã™ã€‚ ãƒ¡ãƒ¢ãƒªãƒ¼ãƒ›ãƒƒãƒˆãƒ—ãƒ©ã‚°ã‚’ã‚µãƒãƒ¼ãƒˆã—ã¦ã„ã‚‹ãƒãƒ¼ãƒ‰ã‚¦ã‚¨ã‚¢ã¯
mooz 2013/01/21
ãƒ¡ãƒ¢ãƒªã®ãƒ›ãƒƒãƒˆãƒ—ãƒ©ã‚°ï¼Žç¨¼å‹•æ™‚ã«ãƒ¡ãƒ¢ãƒªã®è¿½åŠ ã¨å‰Šæ¸›ï¼Ž

linux_kernel

memory
ãƒªãƒ³ã‚¯
Memory management unit - Wikipedia
A 68451 MMU, which could be used with the Motorola 68010 A memory management unit (MMU), sometimes called paged memory management unit (PMMU),[1] is a computer hardware unit that examines all memory references on the memory bus, translating these requests, known as virtual memory addresses, into physical addresses in main memory. In modern systems, programs generally have addresses that access the
mooz 2012/10/10
ä»®æƒ³ã‚¢ãƒ‰ãƒ¬ã‚¹ã‹ã‚‰ç‰©ç†ã‚¢ãƒ‰ãƒ¬ã‚¹ã¸ï¼ŽMemory Protection ã‚‚ MMU ã®ä»•äº‹ï¼Ž

memory

hardware
ãƒªãƒ³ã‚¯
Non-uniform memory access - Wikipedia
The motherboard of an HP Z820 workstation with two CPU sockets, each with their own set of eight DIMM slots surrounding the socket. Non-uniform memory access (NUMA) is a computer memory design used in multiprocessing, where the memory access time depends on the memory location relative to the processor. Under NUMA, a processor can access its own local memory faster than non-local memory (memory lo
mooz 2012/07/14
ccNUMA: cache coherent NUMA

memory

CPU
ãƒªãƒ³ã‚¯
NTT HOME > NTTæŒæ ªä¼šç¤¾ãƒ‹ãƒ¥ãƒ¼ã‚¹ãƒªãƒªãƒ¼ã‚¹ > ä¸–ç•Œåˆã€å…‰RAMãƒãƒƒãƒ—ã®å®Ÿç¾
ï¼ˆãƒ‹ãƒ¥ãƒ¼ã‚¹ãƒªãƒªãƒ¼ã‚¹ï¼‰ 2012å¹´2æœˆ24æ—¥ ä¸–ç•Œåˆã€å…‰RAMãƒãƒƒãƒ—ã®å®Ÿç¾ ï½žè¶…ä½Žæ¶ˆè²»é›»åŠ›ã®é«˜é€Ÿãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯å‡¦ç†å®Ÿç¾ã¸å‰é€²ï½ž æ—¥æœ¬é›»ä¿¡é›»è©±æ ªå¼ä¼šç¤¾ï¼ˆæœ¬ç¤¾ï¼šæ±äº¬éƒ½åƒä»£ç”°åŒºã€ä»£è¡¨å–ç· å½¹ç¤¾é•·ï¼šä¸‰æµ¦ æƒºã€ä»¥ä¸‹ã€€NTTï¼‰ã¯ã€ãƒ•ã‚©ãƒˆãƒ‹ãƒƒã‚¯çµæ™¶â€»1ã¨å‘¼ã°ã‚Œã‚‹äººå·¥æ§‹é€ ã‚’ç”¨ã„ã¦ã€å…‰ãƒ¡ãƒ¢ãƒªã®æ¶ˆè²»é›»åŠ›ã‚’å¾“æ¥æ¯”300åˆ†ã®1ä»¥ä¸‹ã«ä½Žæ¸›ã—ã€é›†ç©ãƒãƒƒãƒ—åŒ–ã—ãŸå…‰ãƒ©ãƒ³ãƒ€ãƒ ã‚¢ã‚¯ã‚»ã‚¹ãƒ¡ãƒ¢ãƒªâ€»2ï¼ˆä»¥ä¸‹ å…‰RAMãƒãƒƒãƒ—ï¼‰ã®å‹•ä½œã‚’ä¸–ç•Œã§åˆã‚ã¦å®Ÿç¾ã—ã¾ã—ãŸã€‚ ä»Šå›žå®Ÿç¾ã—ãŸå…‰RAMãƒãƒƒãƒ—ã‚’ç”¨ã„ã‚‹ã“ã¨ã§ã€å…‰ãƒ‡ãƒ¼ã‚¿ã‚’é›»æ°—ã«å¤‰æ›ã™ã‚‹ã“ã¨ãªãè“„ç©ãƒ»è»¢é€ã™ã‚‹ã“ã¨ãŒå¯èƒ½ã¨ãªã‚Šã€å°†æ¥çš„ã«ãƒ«ãƒ¼ã‚¿ãªã©ã®ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯å‡¦ç†æ©Ÿå™¨ï¼ˆä»¥ä¸‹ã€NWæ©Ÿå™¨ï¼‰ã®å¤§å¹…ãªé«˜é€ŸåŒ–ã€ä½Žæ¶ˆè²»é›»åŠ›åŒ–ãŒæœŸå¾…ã•ã‚Œã¾ã™ã€‚ æœ¬æˆæžœã¯ã€2012å¹´2æœˆ26æ—¥ï¼ˆè‹±å›½æ™‚é–“ï¼‰ã«è‹±å›½ç§‘å¦é›‘èªŒã€ŒNature Photonicsã€ã®ã‚ªãƒ³ãƒ©ã‚¤ãƒ³é€Ÿå ±ç‰ˆã§å…¬é–‹ã•ã‚Œã¾ã™ã€‚ ãªãŠã€æœ¬æˆæžœã®ä¸€éƒ¨ã¯ã€ç‹¬ç«‹è¡Œæ”¿æ³•äººæƒ…å ±é€šä¿¡ç ”ç©¶
mooz 2012/03/14
memory

hardware
ãƒªãƒ³ã‚¯
mmap (ãƒ¡ãƒ¢ãƒªãƒžãƒƒãƒ—ãƒˆãƒ•ã‚¡ã‚¤ãƒ«) : kei@sodan
Linux/Unixã®ãƒ¡ãƒ¢ãƒªå‘¨ã‚Šã§å¤§æ´»èºã®ã‚·ã‚¹ãƒ†ãƒ ã‚³ãƒ¼ãƒ«ã€mmapã®è§£èª¬ã§ã™ã€‚ ã‚¹ãƒ©ã‚¤ãƒ‰(pdf), (pptx), (ppt) ä¸Šè¨˜ã‚¹ãƒ©ã‚¤ãƒ‰åŠã³ã“ã®ãƒšãƒ¼ã‚¸ã®å†…å®¹ã®å¤§éƒ¨åˆ†ã¯ã€(åƒ•ãŒå—ã‘ãŸ) ç”°æµ¦å…ˆç”Ÿ ã®æŽˆæ¥ã‚ªãƒšãƒ¬ãƒ¼ãƒ†ã‚£ãƒ³ã‚°ã‚·ã‚¹ãƒ†ãƒ ã®6å›žç›®ã®ã‚¹ãƒ©ã‚¤ãƒ‰ã¨åŒã˜ã§ã™ã€‚ ã‚ã¨ã€mallocä¸ã®mmap()ã¾ã‚ã‚Šã‚’èª¿ã¹ã¦ãã‚Œã¦ã‚ã‚ŠãŒã¨ã†>ç ”ç©¶å®¤ã®kennyãã‚“ ãƒ•ã‚¡ã‚¤ãƒ«ã¨ãƒ¡ãƒ¢ãƒª mmap()ã®APIãƒ»ä½¿ã„æ–¹ (mallocã®ä¸èº«ã®è©±é¡Œ) mmap()ã®å®Ÿè£…
mooz 2012/03/11
memory

linux_kernel
ãƒªãƒ³ã‚¯
Database Systems
Welcome to the web presence of the Database Research Group at University of TÃ¼bingen. Our group pursues a variety of â€œall-time classicâ€ database research questionsâ€”prime examples include query language design, translation, and optimizationâ€”but with a few twists: We are particularly interested in the design, compilation, and optimization of expressive database languages that support rich data model
mooz 2012/03/10
CPU ã‚„ãƒ¡ãƒ¢ãƒªã‚’æ„è˜ã—ãŸã‚¯ã‚¨ãƒªå‡¦ç†ï¼Žæœ€é©åŒ–ï¼Ž

database

cpu

memory
ãƒªãƒ³ã‚¯
ã€å¾Œè—¤å¼˜èŒ‚ã®Weeklyæµ·å¤–ãƒ‹ãƒ¥ãƒ¼ã‚¹ã€‘ ISSCCã§è¦‹ãˆã¦ããŸNANDãƒ•ãƒ©ãƒƒã‚·ãƒ¥ãƒ¡ãƒ¢ãƒªã®å¤§å®¹é‡åŒ–ã®ãƒˆãƒ¬ãƒ³ãƒ‰
mooz 2012/02/25
Flash memory

storage

memory

flash_memory
ãƒªãƒ³ã‚¯
OSãŒèªè˜ã™ã‚‹ãƒ¡ãƒ¢ãƒªå®¹é‡ã‚’åˆ¶é™ã—ãŸã„ã¨ã at nkjmkzk.net
Oracle, Open Source, Privateç‰¹ã«ãƒ‘ãƒ•ã‚©ãƒ¼ãƒžãƒ³ã‚¹ãƒ†ã‚¹ãƒˆã‚’ã‚„ã£ã¦ã‚‹ã¨ã„ã‚ã„ã‚ã¨OSã®ç’°å¢ƒã‚’å¤‰ãˆã¦çµæžœã‚’è¦‹æ¯”ã¹ãŸããªã‚‹ã¨ããŒã‚ã‚Šã¾ã™ã€‚ãã®ä¸ã§ã€Œãƒ¡ãƒ¢ãƒªå®¹é‡ã‚’å¤‰ãˆãŸã‚‰ã©ã†ãªã‚‹ã‹ï¼Ÿã€ã¨ã„ã†ã¨ããŒã—ã°ã—ã°ã‚ã‚Šã¾ã™ã€‚ãƒ‘ãƒ¯ãƒ¼ãƒ—ãƒ¬ã‚¤ã§ã“ã‚Œã‚’å®Ÿç¾ã™ã‚‹ã«ã¯ã€ã‚ˆã£ã“ã‚‰ã—ã‚‡ã€ã¨ãƒ©ãƒƒã‚¯ã‹ã‚‰ã‚µãƒ¼ãƒã‚’å¼•ãå‡ºã—ã€ã‚±ãƒ¼ã‚¹ã‚’ãƒ‘ã‚«ãƒƒã¨é–‹ã‘ã¦ãƒ¡ãƒ¢ãƒªã‚’å¼•ã£ã“æŠœãã¨ã„ã†æŠ€ãŒæœ€åˆã«æ€ã„ã¤ãã¾ã™ã€‚ã—ã‹ã—ãƒ‡ãƒ¥ã‚¢ãƒ«ãƒãƒ£ãƒãƒ«æ§‹æˆã®å ´åˆçŸçµ¡çš„ã«ãã‚“ãªã“ã¨ã‚’ã—ã¡ã‚ƒã†ã¨ã‚µãƒ¼ãƒãŒèµ·å‹•ã—ãªããªã£ã¦ã—ã¾ã†å¯èƒ½æ€§ãŒã‚ã‚Šã¾ã™ã—ã€ãã‚‚ãã‚‚ç¾å ´ã¾ã§è¨€ã£ã¦ä½œæ¥ã™ã‚‹ã¨ã„ã†ã®ãŒåŽŸå§‹çš„ã§ã™ã€‚ ç°¡å˜ãªæ–¹æ³•ã¯ã€ã‚«ãƒ¼ãƒãƒ«ã®èµ·å‹•ãƒ‘ãƒ©ãƒ¡ãƒ¼ã‚¿ã€Œmemã€ã§OSï¼ˆã‚«ãƒ¼ãƒãƒ«ï¼‰ãŒèªè˜ã™ã‚‹ãƒ¡ãƒ¢ãƒªå®¹é‡ã‚’æŒ‡å®šã—ã¦ã‚ã’ã‚‹ã‚„ã‚Šæ–¹ã§ã™ã€‚ã“ã‚Œã¯/boot/grub/grub.confã‚’ç›´æŽ¥ç·¨é›†ã—ã¦é™çš„ã«è¨å®šã—ã¦ã‚‚ã„ã„ã§ã™ã—ã€èµ·å‹•æ™‚ã«grubãƒ¡ãƒ‹ãƒ¥ãƒ¼ã§éƒ½åº¦è¨å®šã—ã¦ã‚‚OKã§ã™ã€‚ ä¾‹
mooz 2012/02/25
ã‚«ãƒ¼ãƒãƒ«ã®èµ·å‹•ãƒ‘ãƒ©ãƒ¡ãƒ¼ã‚¿ mem ã‚’ GRUB ãªã©ã§æŒ‡å®šï¼Žãƒ‘ãƒ•ã‚©ãƒ¼ãƒžãƒ³ã‚¹ãƒ†ã‚¹ãƒˆã«ï¼Ž

linux

memory
ãƒªãƒ³ã‚¯
ã‚«ã‚¹ã‚¿ãƒ ãƒ¡ãƒ¢ãƒªãƒžãƒãƒ¼ã‚¸ãƒ£ã¨é«˜é€Ÿãªãƒ¡ãƒ¢ãƒªã‚¢ãƒã‚±ãƒ¼ã‚¿ã«ã¤ã„ã¦
2. è‡ªå·±ç´¹ä»‹ ãƒãƒ³ãƒ‰ãƒ«ãƒãƒ¼ãƒ alwei Twitter ID @aizen76 alweiã‚‚ã—ãã¯aizenã®ã©ã¡ã‚‰ã‹ã‚’ä½¿ã£ã¦ã„ã¾ã™ æµæµªã®ã‚²ãƒ¼ãƒ ãƒ—ãƒã‚°ãƒ©ãƒž Wiiã€DSã€PSPã€PS3ã€3DSã®ã‚²ãƒ¼ãƒ ã¨ã‹ä½œã£ã¦ãŸ 2Dã‚²ãƒ¼ãƒ å¥½ããªã®ã«ã€å®Ÿã¯3Dã‚²ãƒ¼ãƒ ã—ã‹ä½œã£ãŸã“ã¨ãŒãªã„ æœ€è¿‘è§¦æ‰‹è»å›£ã«ä»²é–“å…¥ã‚Šã—ã¦ã€ã‚ªãƒ³ãƒ©ã‚¤ãƒ³ã‚²ãƒ¼ãƒ ã‚’ä½œã‚Šå§‹ã‚ã¾ã—ãŸ ã‚¢ã‚¸ãƒ£ã‚¤ãƒ«ã¨ã‹TDDã¨ã‹å‹‰å¼·ä¸
mooz 2012/02/13
ãƒ¡ãƒ¢ãƒªãƒ—ãƒ¼ãƒ«ã‚¢ãƒã‚±ãƒ¼ã‚¿ãŒä¾¿åˆ©

c++

memory

malloc
ãƒªãƒ³ã‚¯
NameBright - Coming Soon
NameBright.com - Next Generation Domain Registration jcmit.com is coming soon
mooz 2012/02/04
[]ãƒ¡ãƒ¢ãƒªã®ä¾¡æ ¼ã¨å®¹é‡ã®å¤‰é·ã‚’ 1957 å¹´ã‹ã‚‰ï¼Žè²´é‡ãªè³‡æ–™ï¼Ž

memory

history
ãƒªãƒ³ã‚¯
The design of preemptible read-copy-update [LWN.net]
October 8, 2007 This article was contributed by Paul McKenney This document walks through the design of preemptible RCU. Introduction Read-copy update (RCU) is a synchronization API that is sometimes used in place of reader-writer locks. RCU's read-side primitives offer extremely low overhead and deterministic execution time. The downside of this deterministic read-side execution time is that RCU
mooz 2012/02/04
Linux Kernel ã«ãŠã‘ã‚‹ RCU å®Ÿè£…

linux_kernel

concurrent

memory
ãƒªãƒ³ã‚¯
Userspace RCU
liburcu is a LGPLv2.1 userspace RCU (read-copy-update) library. This data synchronization library provides read-side access which scales linearly with the number of cores. liburcu-cds provides efficient data structures based on RCU and lock-free algorithms. Those structures include hash tables, queues, stacks, and doubly-linked lists. Documents User-Level Implementations of Read-Copy Update What i
mooz 2012/02/04
Userspace RCU. liburcu.

concurrent

memory
ãƒªãƒ³ã‚¯
ç¬¬2å›žã€€memcachedã®ãƒ¡ãƒ¢ãƒªã‚¹ãƒˆãƒ¬ãƒ¼ã‚¸ã‚’ç†è§£ã™ã‚‹ | gihyo.jp
æ ªå¼ä¼šç¤¾ãƒŸã‚¯ã‚·ã‚£ ç ”ç©¶é–‹ç™ºã‚°ãƒ«ãƒ¼ãƒ—ã®å‰å‚ã§ã™ã€‚å‰å›žã®è¨˜äº‹ã§memcachedã¯åˆ†æ•£ã«é•·ã‘ãŸé«˜é€Ÿãªã‚ãƒ£ãƒƒã‚·ãƒ¥ã‚µãƒ¼ãƒã§ã‚ã‚‹ã“ã¨ãŒç´¹ä»‹ã•ã‚Œã¾ã—ãŸã€‚ä»Šå›žã¯memcachedã®å†…éƒ¨æ§‹é€ ãŒã©ã†å®Ÿè£…ã•ã‚Œã¦ã„ã‚‹ã®ã‹ã€ãã—ã¦ãƒ¡ãƒ¢ãƒªãŒã©ã†ç®¡ç†ã•ã‚Œã¦ã„ã‚‹ã®ã‹ã‚’ã”ç´¹ä»‹ã—ã¾ã™ã€‚ã¾ãŸã€memcachedã®å†…éƒ¨æ§‹é€ ã®äº‹æƒ…ã«ã‚ˆã‚‹å¼±ç‚¹ã‚‚ç´¹ä»‹ã—ã¾ã™ã€‚ ãƒ¡ãƒ¢ãƒªã‚’æ•´ç†ã—ã¦å†åˆ©ç”¨ã™ã‚‹Slab Allocationãƒ¡ã‚«ãƒ‹ã‚ºãƒ æ˜¨ä»Šã®memcachedã¯ãƒ‡ãƒ•ã‚©ãƒ«ãƒˆã§Slab Allocatorã¨ã„ã†ãƒ¡ã‚«ãƒ‹ã‚ºãƒ ã‚’ä½¿ã£ã¦ãƒ¡ãƒ¢ãƒªã®ç¢ºä¿ãƒ»ç®¡ç†ã‚’è¡Œã£ã¦ã„ã¾ã™ã€‚ã“ã®ãƒ¡ã‚«ãƒ‹ã‚ºãƒ ãŒç™»å ´ã™ã‚‹ä»¥å‰ã®ãƒ¡ãƒ¢ãƒªç¢ºä¿ã®æˆ¦ç•¥ã¯ã€å˜ç´”ã«ã™ã¹ã¦ã®ãƒ¬ã‚³ãƒ¼ãƒ‰ã«å¯¾ã—ã¦mallocã¨freeã‚’è¡Œã†ã¨ã„ã£ãŸã‚‚ã®ã§ã—ãŸã€‚ã—ãŒã—ãªãŒã‚‰ã€ã“ã®ã‚¢ãƒ—ãƒãƒ¼ãƒã§ã¯ãƒ¡ãƒ¢ãƒªã«ãƒ•ãƒ©ã‚°ãƒ¡ãƒ³ãƒ†ãƒ¼ã‚·ãƒ§ãƒ³ï¼ˆæ–ç‰‡åŒ–ï¼‰ã‚’ç™ºç”Ÿã•ã›ã¦ã—ã¾ã„ã€OSã®ãƒ¡ãƒ¢ãƒªãƒžãƒãƒ¼ã‚¸ãƒ£ã«è² è·ã‚’ã‹ã‘ã€æœ€æ‚ªã®å ´åˆã ã¨memcachedã®ãƒ—
mooz 2012/01/13
slab allocator, allocation

allocation

memory
ãƒªãƒ³ã‚¯
SSDAlloc - Hybrid SSD/RAM Allocation Made Easy
Hybrid SSD/RAM Memory Management Made Easy. A Nearly-Transparent Programming Model for High-Performance Flash in Virtual Memory. What Is It? Flash memory (mostly in the form of SSDs) is fast becoming an integral part of a wide range of systems, including cell phones, netbooks, laptops, desktops and servers. The integration is happening either in the form of an SSD based swap space or SSD based
mooz 2012/01/13
flash_memory

storage

memory

os
ãƒªãƒ³ã‚¯
Computer memory - Wikipedia
Computer memory stores information, such as data and programs, for immediate use in the computer.[2] The term memory is often synonymous with the terms RAM, main memory, or primary storage. Archaic synonyms for main memory include core (for magnetic core memory) and store.[3] Main memory operates at a high speed compared to mass storage which is slower but less expensive per bit and higher in capa
mooz 2011/12/14
æ®ç™ºæ€§ãƒ¡ãƒ¢ãƒªã«ã¯ DRAM, SRAM ã®ä»–ã« T-RAM, Z-RAM, TTRAM ãªã©ãŒã‚ã‚‹ã¨ã‹ï¼Ž

memory
ãƒªãƒ³ã‚¯
ãƒ¬ãƒƒãƒ‰ãƒãƒƒãƒˆ ãƒžã‚¬ã‚¸ãƒ³ 64ãƒ“ãƒƒãƒˆã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ãƒ†ã‚£ãƒ³ã‚°: 32ãƒ“ãƒƒãƒˆç’°å¢ƒã§ã®å…±å˜
Guilt is usually considered a negative emotion, but by steering it well, you can achieve surprising success.
mooz 2011/12/07
transparent hugepage ã«ã¤ã„ã¦ï¼Ž1 page = 2 MB. hugetlbfs.

linux_kernel

memory
ãƒªãƒ³ã‚¯
ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚° :: é«˜é€Ÿãªãƒ—ãƒã‚°ãƒ©ãƒ ã‚’æ›¸ãç‚ºã« :: ãƒ¡ãƒ¢ãƒª
3. ãƒ¡ãƒ¢ãƒª ã•ã¦ã€ãƒ—ãƒã‚°ãƒ©ãƒ ã®æœ€é©åŒ–ã§ä¸€ç•ªé‡è¦ã«ãªã£ã¦ãã‚‹ã®ã¯ã€ãƒ¡ãƒ¢ãƒªã§ã™ã€‚ ã¯ã£ãã‚Šè¨€ã£ã¦ã€æ•°å€¤è¨ˆç®—ã‚’ã™ã‚‹ãƒ—ãƒã‚°ãƒ©ãƒ ã®ä¸€ç•ªã®ãƒœãƒˆãƒ«ãƒãƒƒã‚¯ã¯ãƒ¡ãƒ¢ãƒªã‚¢ã‚¯ã‚»ã‚¹ã§ã™ã€‚ ä¸‹æ‰‹ãªãƒ—ãƒã‚°ãƒ©ãƒ ã‚’æ›¸ãã¨ã€è¨ˆç®—æ™‚é–“ã®æ®†ã©ãŒãƒ¡ãƒ¢ãƒªã‚¢ã‚¯ã‚»ã‚¹ã®æ™‚é–“ã¨ã„ã†äº‹ã«ãªã‚Šã‹ãã¾ã›ã‚“ã€‚ æ˜”ã¯ã€ãƒ¡ãƒ¢ãƒªã®å‹•ä½œé€Ÿåº¦ã¯é«˜é€Ÿã§ãã®æ§˜ãªäº‹ã¯ãªã‹ã£ãŸã®ã§ã™ãŒã€ æœ€è¿‘ã§ã¯ CPU ã®æ€§èƒ½å‘ä¸ŠãŒæ¿€ã—ãã€ãƒ¡ãƒ¢ãƒªã«è¿½ã„ã¤ãè¿½ã„è¶Šã—ç‰©å‡„ã„å·®ã‚’ä»˜ã‘ã¦ã—ã¾ã„ã¾ã—ãŸã€‚ CPU ã®å‹•ä½œã«ã¤ã„ã¦è¡Œã‘ã‚‹æ§˜ãªé€Ÿã•ã§å‹•ä½œã™ã‚‹ãƒ¡ã‚¤ãƒ³ãƒ¡ãƒ¢ãƒªã¯é«˜ä¾¡ã«ãªã£ã¦ã—ã¾ã„ä½œã‚Œã¾ã›ã‚“ã€‚ ã¾ã‚ã€å€¤æ®µã®å•é¡Œã¯æŠœãã«ã—ãŸã¨ã—ã¦ã‚‚ã€CPU ã®å‹•ä½œã¯é€Ÿã™ãŽã¾ã™ã€‚ ã“ã‚Œã¯ã€å°‘ã—è¨ˆç®—ã—ã¦ã¿ã‚Œã°ç›´ãã«åˆ†ã‹ã‚Šã¾ã™ã€‚ ä»Šå£²ã‚‰ã‚Œã¦ã„ã‚‹ CPU ã§ã¯ã€ã‚³ã‚¢ã®ã‚¯ãƒãƒƒã‚¯å‘¨æ³¢æ•°ãŒé«˜ã„ç‰©ã§ã¯ 4GHz ã«ãªã‚Šã¾ã™ã€‚ ä¾‹ãˆã° 4GHz ã® CPU ã§ 1 clock ã®é–“ã«å…‰ãŒé€²ã‚€è·é›¢ã‚’è€ƒãˆã‚‹ã¨ã€ 3Ã—1010
mooz 2011/11/23
cpu

memory

cache_conscious
ãƒªãƒ³ã‚¯
1 2 æ¬¡ã®ãƒšãƒ¼ã‚¸