BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
prefetch (3)
coverag (2)
base (2)
irregular (2)
optim (1)

Stem stride$ (all stems)

8 papers:

ICSEICSE-2013-HassanA #data flow #multi
Comparing multi-point stride coverage and dataflow coverage (MMH, JHA), pp. 172–181.
ICSEICSE-2012-ZhouXZ #bound #named #polynomial #search-based
Stride: Search-based deterministic replay in polynomial time via bounded linkage (JZ, XX, CZ), pp. 892–902.
Stride prefetching by dynamically inspecting objects (TI, TO, HK, TN), pp. 269–277.
PLDIPLDI-2002-Wu #performance #source code
Efficient Discovery of Regular Stride Patterns in Irregular Programs (YW), pp. 210–221.
ICPRICPR-v4-2002-BenAbdelkaderCD #automation #estimation #identification #using
Person Identification Using Automatic Height and Stride Estimation (CB, RC, LSD), pp. 377–380.
Value-Profile Guided Stride Prefetching for Irregular Code (YW, MJS, RK, WL, JF), pp. 307–324.
HPCAHPCA-1995-DahlgrenS #effectiveness #multi
Effectiveness of Hardware-Based Stride and Sequential Prefetching in Shared-Memory Multiprocessors (FD, PS), pp. 68–77.
ICLPCLP-1990-Malhotra90 #algorithm #prolog
An Algorithm for Optimal Back-Striding in Prolog (VMM), pp. 147–158.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.