207 search results - page 9 / 42 » An algorithm for stabilising multiple stores |
SIGMOD
1997
ACM
15 years 1 months ago
1997
ACM
Computing multiple related group-bys and aggregates is one of the core operations of On-Line Analytical Processing (OLAP) applications. Recently, Gray et al. [GBLP95] proposed the...
SPAA
1996
ACM
15 years 1 months ago
1996
ACM
In this paper, we analyze the performance of parallel multithreaded algorithms that use dag-consistent distributed shared memory. Specifically, we analyze execution time, page fau...
105
click to vote
KES
1999
Springer
15 years 1 months ago
1999
Springer
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
ICPP
2007
IEEE
15 years 3 months ago
2007
IEEE
— Most of existing search algorithms for unstructured peer-to-peer (P2P) systems share one common approach: the requesting node sends out a query and the query message is repeate...
120
click to vote
SASP
2009
IEEE
15 years 4 months ago
2009
IEEE
—This paper describes a multi-threaded parallel design and implementation of the Smith-Waterman (SM) algorithm on compute unified device architecture (CUDA)-compatible graphic pr...