64 search results - page 1 / 13 » Structured Permuting in Place on Parallel Disk Systems |
IOPADS
1996
13 years 6 months ago
1996
The ability to perform permutations of large data sets in place reduces the amount of necessary available disk storage. The simplest way to perform a permutation often is to read ...
SPAA
1993
ACM
13 years 8 months ago
1993
ACM
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
ARCS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract: We report on our experiences with the implementation of a parallel algorithm to compute the cycle structure of a permutation given as an oracle. As a sub-problem, the cyc...
ISSAC
2007
Springer
13 years 10 months ago
2007
Springer
Through the use of a new disk-based method for enumerating very large orbits, condensation for orbits with tens of billions of elements can be performed. The algorithm is novel in...
FTTCS
2006
13 years 4 months ago
2006
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...