Algorithms and data structures for hierarchical memories

Abstract

The memories of real life computers usually have a hierarchical structure with levels like registers, cache, main memory and disks. In contrast, the RAM model is based on a homogeneous memory, hence hidding an important source for speeding up programs, their locality. Locality means that algorithms can be implemented to run the faster the better they are adapted to mechanisms like blocking data or keeping currently used data in fast levels. We describe a model (MDMH) which reflects the most important features of computer memories and is despite of easy enough to design and analyse algorithms. We give MDMH algorithms for basic problems, e.g. maintaining heaps and sorting. Most of them can be proved to be optimal according to a modified measure of asymptotic complexity. Finally, we introduce a parallel version of MDMH modelling memory banks (MDMHP) and describe a general method for translating MDMH algorithms to MDMHP. (orig.)SIGLEAvailable from TIB Hannover: RR 2036(17) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman