3616 search results - page 162 / 724 » Conditional Memory Ordering |
165
click to vote
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
Transactional memory (TM) has shown potential to simplify the task of writing concurrent programs. Inspired by classical work on databases, formal definitions of the semantics of...
151
Voted
CSL
2009
Springer
15 years 10 months ago
2009
Springer
This paper extends for the first time semantic interpretation tools to infinite data in order to ensure Input/Output upper bounds on first order Haskell like programs on streams...
145
Voted
ATVA
2006
Springer
15 years 10 months ago
2006
Springer
We present the implementation of the trace theory in a new model checking tool framework, POEM, that has a strong emphasis on Partial Order Methods. A tree structure is used to sto...
137
click to vote
FPL
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we consider scanning and analyzing packets in order to detect hazardous contents using pattern matching. We introduce a hardware perfect-hashing technique to access...
146
click to vote
ICCS
2004
Springer
15 years 11 months ago
2004
Springer
We consider the realization of matrix-matrix multiplication and propose a hierarchical algorithm implemented in a task-parallel way using multiprocessor tasks on distributed memory...