25,161
edits
Changes
no edit summary
* [https://en.wikipedia.org/wiki/Ken_Knowlton Kenneth C. Knowlton] ('''1965'''). ''A Fast storage allocator''. [[ACM#Communications|Communications of the ACM]], Vol. 8, No. 10 : 623-625
===1970 ...===
* [[Paul W. Purdom]], [[Mathematician#SMStigler|Stephen M. Stigler]] ('''1970'''). ''[https://www.semanticscholar.org/paper/Statistical-Properties-of-the-Buddy-System-Purdom-Stigler/36ffdc1a3960dd9874d676176d1e4bd48c99b528 Statistical Properties of the Buddy System]''. [[ACM#Journal|Journal of the ACM]], Vol. 17, No. 4 <ref>[https://en.wikipedia.org/wiki/Buddy_memory_allocation Buddy memory allocation from Wikipedia]</ref>
* [[Donald Eastlake]] ('''1977'''). ''[http://www.informatik.uni-trier.de/~ley/db/conf/vldb/Eastlake77.html Tertiary Memory Access and Performance in the Datacomputer]''. [http://www.informatik.uni-trier.de/~ley/db/conf/vldb/vldb77.html#Eastlake77 VLDB 1977]
===1980 ...===
* [[Paul W. Purdom]], [[Mathematician#CABrown|Cynthia A. Brown]] ('''1980'''). ''[https://www.semanticscholar.org/paper/Exact-formulas-for-the-buddy-system-Purdom-Brown/edb813045099fe0e657d20e2c7d5b54ddbb9fbcd Exact formulas for the buddy system]''. [https://en.wikipedia.org/wiki/Information_Sciences_(journal) Information Sciences], Vol. 22, No. 1
* [[Ozalp Babaoglu]], [https://en.wikipedia.org/wiki/Bill_Joy William Joy] ('''1981'''). ''Converting a Swap-Based System to do Paging in an Architecture Lacking Page-Reference Bits''. Proceedings of the 8th SOSP, Operating Systems Review, Vol. 15, No. 5, pp. 78-86
* [[Bruce W. Leverett]], [http://genealogy.math.ndsu.nodak.edu/id.php?id=95738 Peter G. Hibbard] ('''1982'''). ''[http://onlinelibrary.wiley.com/doi/10.1002/spe.4380120606/abstract An Adaptive System for Dynamic Storage Allocation]''. [http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe12.html#LeverettH82 Software: Practice and Experience], [http://onlinelibrary.wiley.com/doi/10.1002/spe.v12:6/issuetoc Vol. 12, No. 6], pp. 543-555
* [[Jos Uiterwijk]] ('''1992'''). ''Memory Efficiency in some Heuristics''. [[ICGA Journal#15_2|ICCA Journal, Vol. 15, No. 2]]
* [[Wim Pijls]], [[Arie de Bruin]] ('''1993'''). ''SSS*-like Algorithms in Constrained Memory.'' [[ICGA Journal#16_1|ICCA Journal, Vol. 16, No. 1]]
* [[Hermann Kaindl]], G. Gerhard Kainz, A. Angelika Leeb, H. Harald Smetana ('''1995'''). ''How to use limited memory in heuristic search''. Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence ([[Conferences#IJCAI1995|IJCAI-95), Montreal, Canada, pp. 236-242.1995]]
* [[Matteo Frigo]] ('''1997'''). ''The weakest reasonable memory model.'' Masters Thesis, [[Massachusetts Institute of Technology]], Department of Electrical Engineering and Computer Science, [http://supertech.csail.mit.edu/papers/frigo-ms-thesis.pdf pdf]
* [[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]
* [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]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=77054 PERFT transposition table funny?!] by [[Martin Bryant]], [[CCC]], April 10, 2021 » [[Perft]], [[Transposition Table]]
=External Links=
