About: Stride of an array

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Stride of an array Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

In computer programming, the stride of an array (also referred to as increment, pitch or step size) is the number of locations in memory between beginnings of successive array elements, measured in bytes or in units of the size of the array's elements. The stride cannot be smaller than the element size but can be larger, indicating extra space between elements.

Attributes	Values
rdfs:label	Stride of an array (en)
rdfs:comment	In computer programming, the stride of an array (also referred to as increment, pitch or step size) is the number of locations in memory between beginnings of successive array elements, measured in bytes or in units of the size of the array's elements. The stride cannot be smaller than the element size but can be larger, indicating extra space between elements. (en)
sameAs	Stride of an array Stride of an array
dbp:wikiPageUsesTemplate	dbt:Citation_needed dbt:Refimprove dbt:Reflist dbt:Rp
Subject	Arrays Articles with example C code
gold:hypernym	Number
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Stride_of_an_array?oldid=1067914058&ns=0
Wikipage page ID	366038 (xsd:integer)
page length (characters) of wiki page	5249 (xsd:nonNegativeInteger)
Wikipage revision ID	1067914058 (xsd:integer)
has abstract	In computer programming, the stride of an array (also referred to as increment, pitch or step size) is the number of locations in memory between beginnings of successive array elements, measured in bytes or in units of the size of the array's elements. The stride cannot be smaller than the element size but can be larger, indicating extra space between elements. An array with stride of exactly the same size as the size of each of its elements is contiguous in memory. Such arrays are sometimes said to have unit stride. Unit stride arrays are sometimes more efficient than non-unit stride arrays, but non-unit stride arrays can be more efficient for or multi-dimensional arrays, depending on the effects of caching and the access patterns used. This can be attributed to the principle of locality, specifically spatial locality. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Stride_of_an_array
is Wikipage redirect of	Nonunit stride array Unit stride array
is Link from a Wikipage to another Wikipage of	NumPy Addressing mode Array data structure Basic Linear Algebra Subprograms Nonunit stride array Dope vector Convolutional neural network Cooley–Tukey FFT algorithm Memory access pattern

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software