Sciweavers

6181 search results - page 81 / 1237
» Transactional Cluster Computing
Sort
View
PARLE
1992
14 years 7 days ago
Performance Evaluation of Parallel Transaction Processing in Shared Nothing Database Systems
Complex and data-intensive database queries mandate parallel processing strategies to achieve sufficiently short response times. In praxis, parallel database processing is mostly b...
Robert Marek, Erhard Rahm
SPAA
2010
ACM
13 years 8 months ago
A universal construction for wait-free transaction friendly data structures
Given the sequential implementation of any data structure, we show how to obtain an efficient, wait-free implementation of that data structure shared by any fixed number of proces...
Phong Chuong, Faith Ellen, Vijaya Ramachandran
IPPS
2009
IEEE
14 years 2 months ago
Early experiences on accelerating Dijkstra's algorithm using transactional memory
In this paper we use Dijkstra’s algorithm as a challenging, hard to parallelize paradigm to test the efficacy of several parallelization techniques in a multicore architecture....
Nikos Anastopoulos, Konstantinos Nikas, Georgios I...
ICDCS
1997
IEEE
14 years 11 days ago
Fragment Reconstruction: Providing Global Cache Coherence in a Transactional Storage System
Cooperative caching is a promising technique to avoid the increasingly formidable disk bottleneck problem in distributed storage systems; it reduces the number of disk accesses by...
Atul Adya, Miguel Castro, Barbara Liskov, Umesh Ma...
DIS
2004
Springer
13 years 12 months ago
An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases
: The class of closed patterns is a well known condensed representations of frequent patterns, and have recently attracted considerable interest. In this paper, we propose an effic...
Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Ari...