Sciweavers

3616 search results - page 3 / 724
» Conditional Memory Ordering
Sort
View
FM
2009
Springer
134views Formal Methods» more  FM 2009»
13 years 8 months ago
Partial Order Reductions Using Compositional Confluence Detection
Abstract. Explicit state methods have proven useful in verifying safetycritical systems containing concurrent processes that run asynchronously and communicate. Such methods consis...
Frédéric Lang, Radu Mateescu
HICSS
2003
IEEE
99views Biometrics» more  HICSS 2003»
14 years 4 months ago
"Yeah, the Rush ain't here yet - Take a break": Creation and Use of an Artifact as Organizational Memory
In order to understand organizational memory, it is important to understand how things become adopted as memory resources in organizations. In this paper, we describe the genesis ...
Christine Halverson, Mark S. Ackerman
SPAA
2009
ACM
14 years 11 months ago
Inherent limitations on disjoint-access parallel implementations of transactional memory
Transactional memory (TM) is a promising approach for designing concurrent data structures, and it is essential to develop better understanding of the formal properties that can b...
Hagit Attiya, Eshcar Hillel, Alessia Milani
CGO
2009
IEEE
14 years 5 months ago
Reducing Memory Ordering Overheads in Software Transactional Memory
—Most research into high-performance software transactional memory (STM) assumes that transactions will run on a processor with a relatively strict memory model, such as Total St...
Michael F. Spear, Maged M. Michael, Michael L. Sco...
CIDR
2009
152views Algorithms» more  CIDR 2009»
13 years 12 months ago
Visualizing the robustness of query execution
In database query processing, actual run-time conditions (e.g., actual selectivities and actual available memory) very often differ from compile-time expectations of run-time cond...
Goetz Graefe, Harumi A. Kuno, Janet L. Wiener