PDIS
1994
IEEE
13 years 11 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 ...
PDIS
1994
IEEE
13 years 11 months ago
1994
IEEE
Constructing scalable high-performance applications on commodity hardware running the Unix operating system is a problem that must be addressed in several application domains. We ...
PDIS
1994
IEEE
13 years 11 months ago
1994
IEEE
Many parallel join algorithms have been proposed so far but most of which are developed focused on minimizing the disk It0 and CPU costs. The communication cost, however, is also ...
PDIS
1994
IEEE
13 years 11 months ago
1994
IEEE
PDIS
1994
IEEE
13 years 11 months ago
1994
IEEE
Four per-session guarantees are proposed to aid users and applications of weakly consistent replicated data: Read Your Writes, Monotonic Reads, Writes Follow Reads, and Monotonic ...
PDIS
1994
IEEE
13 years 11 months ago
1994
IEEE
We present a scalable garbage collection scheme for systems that store objects at multiple servers while clients run transactions on locally cached copies of objects. It is the fi...
IPPS
1994
IEEE
13 years 11 months ago
1994
IEEE
Synchronization primitives for large shared-memory multiprocessors need to minimize latency and contention. Software queue-based locks address these goals, but suffer if a process...
IPPS
1994
IEEE
13 years 11 months ago
1994
IEEE
IPPS
1994
IEEE
13 years 11 months ago
1994
IEEE
IPPS
1994
IEEE
13 years 11 months ago
1994
IEEE
This paper describes several algorithms to perform all-to-all communication on a two-dimensional mesh connected computer with wormhole routing. We discuss both direct algorithms, ...