281 search results - page 18 / 57 » Implementations of Randomized Sorting on Large Parallel Mach... |
VLDB
1999
ACM
14 years 3 days ago
1999
ACM
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
FAC
2002
13 years 7 months ago
2002
Parallel computers have not yet had the expected impact on mainstream computing. Parallelism adds a level of complexity to the programming task that makes it very error-prone. More...
SC
1995
ACM
13 years 11 months ago
1995
ACM
Given the large communication overheads characteristic of modern parallel machines, optimizations that eliminate, hide or parallelize communication may improve the performance of ...
ICPP
2002
IEEE
14 years 25 days ago
2002
IEEE
In this paper, we formulate the array robustness theorems (ARTs) for efficient computation and communication on faulty arrays. No hardware redundancy is required and no assumptio...
MLDM
2009
Springer
14 years 2 months ago
2009
Springer
In a world where massive amounts of data are recorded on a large scale we need data mining technologies to gain knowledge from the data in a reasonable time. The Top Down Induction...