Sciweavers

3616 search results - page 17 / 724
» Conditional Memory Ordering
Sort
View
MOC
2002
86views more  MOC 2002»
15 years 2 months ago
Hermite interpolation of nonsmooth functions preserving boundary conditions
Abstract. This article is devoted to the construction of a Hermite-type regularization operator transforming functions that are not necessarily C1 into globally C1 finite-element f...
V. Girault, L. R. Scott
IPPS
2008
IEEE
15 years 8 months ago
Build to order linear algebra kernels
—The performance bottleneck for many scientific applications is the cost of memory access inside linear algebra kernels. Tuning such kernels for memory efficiency is a complex ...
Jeremy G. Siek, Ian Karlin, Elizabeth R. Jessup
95
Voted
CASES
2003
ACM
15 years 7 months ago
Lattice-based memory allocation
—We investigate the problem of memory reuse in order to reduce the memory needed to store an array variable. We develop techniques that can lead to smaller memory requirements in...
Alain Darte, Robert Schreiber, Gilles Villard
TOPNOC
2010
14 years 9 months ago
Search-Order Independent State Caching
Abstract. State caching is a memory reduction technique used by model checkers to alleviate the state explosion problem. It has traditionally been coupled with a depth-first search...
Sami Evangelista, Lars Michael Kristensen
121
Voted
CAV
2004
Springer
154views Hardware» more  CAV 2004»
15 years 6 months ago
Automatic Verification of Sequential Consistency for Unbounded Addresses and Data Values
Sequential consistency is the archetypal correctness condition for the memory protocols of shared-memory multiprocessors. Typically, such protocols are parameterized by the number ...
Jesse D. Bingham, Anne Condon, Alan J. Hu, Shaz Qa...