Sciweavers

6939 search results - page 701 / 1388
» Algorithm Engineering for Parallel Computation
Sort
View
VLDB
2007
ACM
166views Database» more  VLDB 2007»
16 years 1 months ago
To Share or Not To Share?
Intuitively, aggressive work sharing among concurrent queries in a database system should always improve performance by eliminating redundant computation or data accesses. We show...
Ryan Johnson, Nikos Hardavellas, Ippokratis Pandis...
HPDC
2005
IEEE
16 years 25 days ago
A new metric for robustness with application to job scheduling
Scheduling strategies for parallel and distributed computing have mostly been oriented toward performance, while striving to achieve some notion of fairness. With the increase in ...
Darin England, Jon B. Weissman, Jayashree Sadagopa...
ICPP
1993
IEEE
15 years 11 months ago
Activity Counter: New Optimization for the Dynamic Scheduling of SIMD Control Flow
SIMD or vector computers and collection-oriented languages, like C , are designed to perform the same computation on each data item or on just a subset of the data. Subsets of pro...
Ronan Keryell, Nicolas Paris
FGCS
2007
86views more  FGCS 2007»
15 years 7 months ago
A grid-based approach for enterprise-scale data mining
Abstract— We describe a grid-based approach for enterprisescale data mining that leverages database technology for I/O parallelism, and on-demand compute servers for compute para...
Ramesh Natarajan, Radu Sion, Thomas Phan
SPAA
1997
ACM
15 years 11 months ago
HARP: A Fast Spectral Partitioner
- Partitioning unstructured graphs is central to the parallel solution of computational science and engineering problems. Spectral partitioners, such recursive spectral bisection (...
Horst D. Simon, Andrew Sohn, Rupak Biswas