Changes

Jump to: navigation, search

Memory

2,000 bytes added, 16:29, 28 September 2020
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/SDRAM Synchronous dynamic random access memory (SDRAM)]: * [https://en.wikipedia.org/wiki/DDR_SDRAM DDR SDRAM] with [https://en.wikipedia.org/wiki/Double_data_rate Double data rate]** <span id="DDR2"></span>[https://en.wikipedia.org/wiki/DDR2_SDRAM DDR2 SDRAM]** <span id="DDR3"></span>[https://en.wikipedia.org/wiki/DDR3_SDRAM DDR3 SDRAM]** <span id="DDR4"></span>[https://en.wikipedia.org/wiki/DDR4_SDRAM DDR4 SDRAM]** <span id="DDR5"></span>[https://en.wikipedia.org/wiki/DDR5_SDRAM DDR5 SDRAM]
* [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=
* [[Dennis Breuker]] ('''1998'''). ''Memory versus Search in Games''. Ph.D. thesis, [[Maastricht University]], pdf available via [http://www.dennisbreuker.nl/thesis/index.html Dennis Breuker's page]
* [[Harald Prokop]] ('''1999'''). ''Cache-Oblivious Algorithms''. Masters thesis, Department of Electrical Engineering and Computer Science, [[Massachusetts Institute of Technology|MIT]], [http://supertech.csail.mit.edu/papers/Prokop99.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Cache-oblivious_algorithm Cache-oblivious algorithm from Wikipedia]</ref>
* [[Erik D. Demaine]], [[Mathematician#JIMunro|J. Ian Munro]] ('''1999'''). ''[http://erikdemaine.org/papers/Buddy_FSTTCS99/ Fast Allocation and Deallocation with an Improved Buddy System]''. [https://dblp.uni-trier.de/db/conf/fsttcs/fsttcs99.html FSTTCS 1999], [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science], Vol. 1738, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer] <ref>[https://en.wikipedia.org/wiki/Buddy_memory_allocation Buddy memory allocation from Wikipedia]</ref>
===2000 ...===
* [http://dblp.uni-trier.de/pers/hd/y/Yang:Yue Yue Yang], [http://dblp.uni-trier.de/pers/hd/g/Gopalakrishnan:Ganesh Ganesh Gopalakrishnan], [[Gary Lindstrom]] ('''2002'''). ''Specifying Java Thread Semantics Using a Uniform Memory Model''. [http://dblp.uni-trier.de/db/conf/java/java2002.html#YangGL02 Java Grande 2002], [http://formalverification.cs.utah.edu/yyang/papers/umm_old.pdf pdf]
: [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 ...===
===1980 ...===
* [[Marvin Minsky]] ('''1980'''). ''K-Lines: A Theory of Memory''. Cognitive Science 4, 117-133, [http://csjarchive.cogsci.rpi.edu/1980v04/i02/p0117p0133/MAIN.PDF pdf] <ref>[https://en.wikipedia.org/wiki/K-line_%28artificial_intelligence%29 K-line (artificial intelligence) from Wikipedia]</ref>
* [[Dennis H. Holding]], [[Robert I. Reynolds]] ('''1982'''). ''[httphttps://link.springer.com/article/10.3758%2FBF03197635?LI=true#page-1 /BF03197635 Recall or Evaluation of Chess Positions as Determinants of Chess Skill]''. [httphttps://www.springer.com/psychology/cognitive+psychology/journal/13421 Memory & Cognition], Vol. 10, No. 3, 237-242
* [[A. Harry Klopf]] ('''1982'''). ''The Hedonistic Neuron: A Theory of Memory, Learning, and Intelligence''. Hemisphere Publishing Corporation, [[University of Michigan]]
===1990 ...===
* [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'''
* [http://www.talkchess.com/forum/viewtopic.php?t=61472 What do you do with NUMA?] by [[Matthew Lai]], [[CCC]], September 19, 2016 » [[NUMA]]
* [http://rybkaforum.net/cgi-bin/rybkaforum/topic_show.pl?tid=31867 L3 cache, RAM and other performance factors] by Nimzy, [[Computer Chess Forums|Rybka Forum]], December 04, 2016 » [[Playing Strength]]
'''2017...'''
* [http://www.talkchess.com/forum/viewtopic.php?t=63652 6-men Syzygy from HDD and USB 3.0] by [[Kai Laskos]], [[CCC]], April 04, 2017 » [[Komodo]], [[Playing Strength]], [[Syzygy Bases]], [[Memory#USB3|USB 3.0]]
* [http://www.talkchess.com/forum/viewtopic.php?t=63886 RAM speed and engine strength] by John Hartmann, [[CCC]], May 03, 2017 » [[Memory#RAM|RAM]], [[Playing Strength]]
* [http://www.talkchess.com/forum/viewtopic.php?t=65284 Probing tablebases through USB 3.0] by [[Jon Fredrik Åsvang]], [[CCC]], September 25, 2017 » , [[Syzygy Bases]], [[Memory#USB3|USB 3.0]]* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=70586 Prefetch and Threading] by [[Dennis Sceviour]], [[CCC]], April 25, 2019 » [[Thread]], [[Transposition Table]]==2020 ...==* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=74751 History of Memory Wall in Computer Chess?] by [[Srdja Matovic]], [[CCC]], August 11, 2020* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=75116 Memory management and threads] by [[Chris Whittington]], [[CCC]], September 15, 2020 » [[Thread]]
=External Links=

Navigation menu