short time ago a chap told me: we may have to many of it already as you'll seldom hear these days: i am runnning out of memory.

truly you miss something, if you just listen to historians and don't consider that memory may be dynamic, associative and even transactional:

TM (transactional memory) provides a new concurrency-control construct that avoids the pitfalls of locks and significantly eases concurrent programming. It brings to mainstream parallel programming proven concurrency-control concepts used for decades by the database community. Transactional-language constructs are easy to use and can lead to programs that scale. | queue, unlocking concurrency

update: critizism on that approach by patrick logan

also worth reading a conversation with john hennessy and david patterson, the authors of the fat, heavy weight book: computer architecture: a quantitative approach.