Sciweavers

5005 search results - page 9 / 1001
» The Design and Analysis of Parallel Algorithms
Sort
View
PPAM
2005
Springer
15 years 3 months ago
Parallel Query Processing and Edge Ranking of Graphs
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
Dariusz Dereniowski, Marek Kubale
FUIN
2006
139views more  FUIN 2006»
14 years 10 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
IPPS
2002
IEEE
15 years 3 months ago
Massively Parallel Solutions for Molecular Sequence Analysis
In this paper we present new approaches to high performance protein database scanning on two novel massively parallel architectures to gain supercomputer power at low cost. The ...
Bertil Schmidt, Heiko Schröder, Manfred Schim...
ICS
2005
Tsinghua U.
15 years 3 months ago
What is worth learning from parallel workloads?: a user and session based analysis
Learning useful and predictable features from past workloads and exploiting them well is a major source of improvement in many operating system problems. We review known parallel ...
Julia Zilber, Ofer Amit, David Talby
IPPS
2009
IEEE
15 years 4 months ago
Designing efficient sorting algorithms for manycore GPUs
Nadathur Satish, Mark Harris, Michael Garland