25,161
edits
Changes
no edit summary
[https://en.wikipedia.org/wiki/Dynamic_random_access_memory Dynamic random access memory] (DRAM) is a type of random access memory that stores each bit of data in a separate [https://en.wikipedia.org/wiki/Capacitor capacitor] within an electronic circuit. Since capacitors leak charge, the information eventually fades unless the capacitor charge is [https://en.wikipedia.org/wiki/Memory_refresh refreshed] periodically, which is the reason to call that memory dynamic. Since DRAM takes only one [https://en.wikipedia.org/wiki/Transistor transistor] and capacitor per bit, it is therefor used as cheap main memory part of recent [https://en.wikipedia.org/wiki/Computer_data_storage computer data storage], despite its worse latency compared to SRAM.
* [https://en.wikipedia.org/wiki/Dynamic_random_access_memory Dynamic random access memory from Wikipedia]
* [https://en.wikipedia.org/wiki/Interleaved_memory Interleaved memory]
* [https://en.wikipedia.org/wiki/SDRAM_latency SDRAM latency]
Since each data-bit stored in a ROM is a boolean function of its inputs or address, a ROM is also used to implement [[Combinatorial Logic|combinatorial logic]].
* [https://en.wikipedia.org/wiki/Read-only_memory Read-only memory from Wikipedia]
=Persistence=* [https://en.wikipedia.org/wiki/Persistence_(computer_science) Persistence]* [https://en.wikipedia.org/wiki/Non-volatile_memory Non-volatile memory from Wikipedia]* [https://en.wikipedia.org/wiki/Non-volatile_random-access_memory Non-volatile random-access memory]* [https://en.wikipedia.org/wiki/Persistent_memory Persistent memory]
=Auxiliary Storage=
: [http://lwn.net/Articles/254445/ Memory part 4: NUMA support]
: [http://lwn.net/Articles/255364/ Memory part 5: What programmers can do]
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=70113 David Gay], [https://dblp.uni-trier.de/pers/hd/e/Ennals:Robert Robert Ennals], [[Eric Brewer]] ('''2007'''). ''[https://dl.acm.org/citation.cfm?id=1296911 Safe manual memory management]''. [https://dblp.uni-trier.de/db/conf/iwmm/ismm2007.html ISMM 2007]
* [[David Silver]], [[Richard Sutton]], [[Martin Müller]] ('''2008'''). ''Sample-Based Learning and Search with Permanent and Transient Memories''. In Proceedings of the 25th International Conference on Machine Learning, [http://webdocs.cs.ualberta.ca/%7Esilver/David_Silver/Publications_files/dyna2.pdf pdf]
===2010 ...===
* [http://www.talkchess.com/forum/viewtopic.php?t=38441 MSVC calloc question] by [[Harm Geert Muller]], [[CCC]], March 17, 2011
'''2012'''
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=43770 Memory question] by [[Fermin Serrano]], [[CCC]], May 19, 2012
* [http://www.talkchess.com/forum/viewtopic.php?t=44826 DNA data storage breaks records] by Terry McCracken, [[CCC]], August 18, 2012 <ref>[https://en.wikipedia.org/wiki/George_Church George Church], [http://www.bme.jhu.edu/people/primary.php?id=1045 Yuan Gao], [http://openwetware.org/wiki/Sriram_Kosuri Sriram Kosuri] ('''2012'''). ''[http://www.sciencemag.org/content/early/2012/08/15/science.1226355 Next-Generation Digital Information Storage in DNA]''. [https://en.wikipedia.org/wiki/Science_%28journal%29 Science]</ref>
'''2013'''
