Talk:Memory-bound function
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||
| |||||||||||||||||
My senior theis project concerns the use of memory bound functions. I could find only few websites on the Internet that have information on memory bound, and this article is based on a number of papers I've read. I've abstained from going into detail about the implementation of memory bound functions, since it's too technical, but if you could explain it plainly, by all means, please do so. 2994 17:55, 13 December 2005 (UTC)
Better example than Fibonacci numbers?
editFirstly, there exists a closed-form formula for Fibonacci numbers, so they can be computed in constant time and memory. Secondly, as pointed out in the article, Fibonacci numbers can be computed in either a memory-bound or a CPU-bound way. Are there examples of functions that are inherently memory-bound? That would be a great addition to this article. Ihearthonduras (talk) 15:00, 25 February 2019 (UTC)
Mentions of spam fighting
editHello! I think that the sections on spam fighting are off-point for this article, but most certainly so for the introduction sentence. To my knowledge, the proposed system has not been implemented. Is itbeneficial to keep it in the article? --Lpd-Lbr (talk) 11:49, 11 November 2019 (UTC)
Differentiate
editI propose we differentiate between Memory wall with Memory bottleneck, and Von Neumann architecture#Von Neumann bottleneck. Best. These are all related concept that should be linked. AXONOV (talk) ⚑ 09:45, 26 May 2022 (UTC)