Sciweavers

26 search results - page 5 / 6
» Exploiting distributed version concurrency in a transactiona...
Sort
View
PPOPP
2012
ACM
12 years 1 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal
ICDCSW
2003
IEEE
13 years 11 months ago
Broadcast Data Organizations and Client Side Cache
Broadcasting provides an e cient means for disseminating information in both wired and wireless setting. In this paper, we study di erent client side cache organizations for vario...
Oleg Shigiltchoff, Panos K. Chrysanthis, Evaggelia...
EUROPAR
2004
Springer
13 years 9 months ago
Efficient Parallel Hierarchical Clustering
Hierarchical agglomerative clustering (HAC) is a common clustering method that outputs a dendrogram showing all N levels of agglomerations where N is the number of objects in the d...
Manoranjan Dash, Simona Petrutiu, Peter Scheuerman...
JPDC
2008
134views more  JPDC 2008»
13 years 5 months ago
Middleware for data mining applications on clusters and grids
This paper gives an overview of two middleware systems that have been developed over the last 6 years to address the challenges involved in developing parallel and distributed imp...
Leonid Glimcher, Ruoming Jin, Gagan Agrawal
ASPLOS
2009
ACM
14 years 6 months ago
Dynamic prediction of collection yield for managed runtimes
The growth in complexity of modern systems makes it increasingly difficult to extract high-performance. The software stacks for such systems typically consist of multiple layers a...
Michal Wegiel, Chandra Krintz