Sciweavers

6181 search results - page 80 / 1237
» Transactional Cluster Computing
Sort
View
124
Voted
ACTA
2007
85views more  ACTA 2007»
15 years 2 months ago
The complexity of satisfying constraints on databases of transactions
Abstract Computing frequent itemsets is one of the most prominent problems in data mining. Recently, a new related problem, called FREQSAT, was introduced and studied: given some i...
Toon Calders
111
Voted
SPAA
2009
ACM
16 years 2 months ago
On avoiding spare aborts in transactional memory
This paper takes a step toward developing a theory for understanding aborts in transactional memory systems (TMs). Existing TMs may abort many transactions that could, in fact, co...
Idit Keidar, Dmitri Perelman
111
Voted
SPAA
2009
ACM
16 years 2 months ago
Brief announcement: selfishness in transactional memory
In order to be efficient with selfish programmers, a multicore transactional memory (TM) system must be designed such that it is compatible with good programming incentives (GPI),...
Raphael Eidenbenz, Roger Wattenhofer
118
Voted
GCC
2003
Springer
15 years 7 months ago
Preserving Data Consistency in Grid Databases with Multiple Transactions
High performance Grid computing provides an infrastructure for access and processing of large volume, terabyte or even petabytes, of distributed data. Research in data grid has foc...
Sushant Goel, Hema Sharda, David Taniar
86
Voted
DSN
2000
IEEE
15 years 6 months ago
Implementing e-Transactions with Asynchronous Replication
ts the abstraction of e-Transactions in three-tier architectures. Three-tier architectures are typically Internetoriented architectures, where the end-user interacts with frontend ...
Svend Frølund, Rachid Guerraoui