Sciweavers

290 search results - page 49 / 58
» Software transactional distributed shared memory
Sort
View
PPOPP
2010
ACM
15 years 6 months ago
A practical concurrent binary search tree
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on optimistic techniques adapted from software transact...
Nathan Grasso Bronson, Jared Casper, Hassan Chafi,...
TPDS
2002
198views more  TPDS 2002»
14 years 9 months ago
Orthogonal Striping and Mirroring in Distributed RAID for I/O-Centric Cluster Computing
This paper presents a new distributed disk-array architecture for achieving high I/O performance in scalable cluster computing. In a serverless cluster of computers, all distribute...
Kai Hwang, Hai Jin, Roy S. C. Ho
PODC
2010
ACM
15 years 1 months ago
Group mutual exclusion in O(log n) RMR
We present an algorithm to solve the GROUP MUTUAL EXCLUSION problem in the cache-coherent (CC) model. For the same problem in the distributed shared memory (DSM) model, Danek and ...
Vibhor Bhatt, Chien-Chung Huang
CCGRID
2002
IEEE
15 years 2 months ago
Overcoming the Problems Associated with the Existence of Too Many DSM APIs
Despite the large research efforts in the SW–DSM community, this technology has not yet been adapted widely for significant codes beyond benchmark suites. One of the reasons co...
Martin Schulz
BMCBI
2010
139views more  BMCBI 2010»
14 years 9 months ago
A highly efficient multi-core algorithm for clustering extremely large datasets
Background: In recent years, the demand for computational power in computational biology has increased due to rapidly growing data sets from microarray and other high-throughput t...
Johann M. Kraus, Hans A. Kestler