147 search results - page 5 / 30 » A Distributed and Oblivious Heap |
CPC
2004
14 years 11 months ago
2004
Heap ordered trees are planted plane trees, labelled in such a way that the labels always increase from the root to a leaf. We study two parameters, assuming that p of the n nodes ...
IPPS
2000
IEEE
15 years 4 months ago
2000
IEEE
1 The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a s...
108
click to vote
CAP
2010
14 years 6 months ago
2010
We present a parallel algorithm for exact division of sparse distributed polynomials on a multicore processor. This is a problem with significant data dependencies, so our solutio...
79
Voted
IPPS
2005
IEEE
15 years 5 months ago
2005
IEEE
We introduce a set of techniques to both measure and optimize memory access locality of Java applications running on cc-NUMA servers. These techniques work at the object level and...
95
Voted
ISSAC
2009
Springer
15 years 6 months ago
2009
Springer
We present a high performance algorithm for multiplying sparse distributed polynomials using a multicore processor. Each core uses a heap of pointers to multiply parts of the poly...