3531 search results - page 154 / 707 » Virtualizing Disk Performance |
ARCS
2004
Springer
15 years 3 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...
102
click to vote
CIARP
2004
Springer
15 years 3 months ago
2004
Springer
Geometric moments have been proven to be a very efficient tool for description and recognition of binary shapes. Numerous methods for effective calculation of image moments have be...
HPDC
1998
IEEE
15 years 2 months ago
1998
IEEE
We propose a new parallel, noncollective I/O strategy called Distant I/O that targets clustered computer systems in which disks are attached to compute nodes. Distant I/O allows o...
PDIS
1994
IEEE
15 years 2 months ago
1994
IEEE
Informed prefetching provides a simple mechanism for I/O-intensive, cache-ineffective applications to efficiently exploit highly-parallel I/O subsystems such as disk arrays. This ...
VLDB
1992
ACM
15 years 2 months ago
1992
ACM
It is often the case that the set of values over which a B-Tree is constructed has a skewed distribution. We present a geometric growth technique to manage postings records in suc...