/str:' d*d/ (scientific computing) Said of a sequence of memory reads and writes to addresses, each of which is separated from the last by a constant interval called "the stride length", or just "the stride". These can be a worst-case access pattern for cache schemes when the stride length is a multiple of the cache line size. Strided references are often generated by loops through an array, and (if the data is large enough that access-time is significant) it can be worthwhile to tune for better locality by inverting double loops or by partially unrolling the outer loop of a loop nest. [Jargon File] (1994-12-21)

In addition suitable contents:
[ 2 ] [ = ] [ ad ] [ address ] [ ai ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ arg ] [ array ] [ as ] [ at ] [ b ] [ be ] [ by ] [ ca ] [ cache ] [ cache line ] [ case ] [ cc ] [ ch ] [ ci ] [ co ] [ com ] [ computing ] [ con ] [ cons ] [ data ] [ dd ] [ de ] [ do ] [ du ] [ ed ] [ er ] [ era ] [ es ] [ et ] [ fi ] [ file ] [ fo ] [ for ] [ fr ] [ ge ] [ gen ] [ generate ] [ gh ] [ gn ] [ gt ] [ h ] [ hat ] [ hr ] [ id ] [ ie ] [ il ] [ in ] [ int ] [ is ] [ it ] [ J ] [ Jargon File ] [ la ] [ Lex ] [ li ] [ line ] [ locality ] [ loop ] [ lt ] [ ly ] [ memory ] [ mo ] [ mod ] [ module ] [ mp ] [ mu ] [ na ] [ nc ] [ ne ] [ ng ] [ ni ] [ no ] [ nr ] [ ns ] [ om ] [ op ] [ pa ] [ ph ] [ pl ] [ query ] [ rc ] [ re ] [ reference ] [ ro ] [ S ] [ sc ] [ se ] [ si ] [ sig ] [ st ] [ T ] [ th ] [ to ] [ tr ] [ tt ] [ tune ] [ ug ] [ us ] [ va ] [ ve ] [ while ] [ write ]