Sciweavers

233 search results - page 25 / 47
» Implementing Signatures for Transactional Memory
Sort
View
FIMI
2003
123views Data Mining» more  FIMI 2003»
14 years 11 months ago
Apriori, A Depth First Implementation
We will discuss , the depth first implementation of APRIORI as devised in 1999 (see [8]). Given a database, this algorithm builds a trie in memory that contains all frequent item...
Walter A. Kosters, Wim Pijls
HPCA
2007
IEEE
15 years 3 months ago
Error Detection via Online Checking of Cache Coherence with Token Coherence Signatures
To provide high dependability in a multithreaded system despite hardware faults, the system must detect and correct errors in its shared memory system. Recent research has explore...
Albert Meixner, Daniel J. Sorin
IJISEC
2006
106views more  IJISEC 2006»
14 years 9 months ago
Execution transactions for defending against software failures: use and evaluation
We examine the problem of containing buffer overflow attacks in a safe and efficient manner. Briefly, we automatically augment source code to dynamically catch stack and heap-based...
Stelios Sidiroglou, Angelos D. Keromytis
POPL
2008
ACM
15 years 9 months ago
High-level small-step operational semantics for transactions
Software transactions have received significant attention as a way to simplify shared-memory concurrent programming, but insufficient focus has been given to the precise meaning o...
Katherine F. Moore, Dan Grossman
IEEEPACT
2009
IEEE
14 years 7 months ago
Adaptive Locks: Combining Transactions and Locks for Efficient Concurrency
Transactional memory is being advanced as an alternative to traditional lock-based synchronization for concurrent programming. Transactional memory simplifies the programming mode...
Takayuki Usui, Reimer Behrends, Jacob Evans, Yanni...