Authors
Bowen Alpern, Larry Carter, Ephraim Feig, Ted Selker
Publication date
1994/9
Journal
Algorithmica
Volume
12
Pages
72-109
Publisher
Springer-Verlag
Description
TheUniform Memory Hierarchy (UMH) model introduced in this paper captures performance-relevant aspects of the hierarchical nature of computer memory. It is used to quantify architectural requirements of several algorithms and to ratify the faster speeds achieved by tuned implementations that use improved data-movement strategies.
A sequential computer's memory is modeled as a sequence <M 0,M 1,...> of increasingly large memory modules. Computation takes place inM 0. Thus,M 0 might model a computer's central processor, whileM 1 might be cache memory,M 2 main memory, and so on. For each moduleM u, a busB u connects it with the next larger module Mu+1. All buses may be active simultaneously. Data is transferred along a bus in fixed-sized blocks. The size of these blocks …
Total citations
1993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202454132010141511151511131710513712626134443415372
Scholar articles