Presents a futures-based algorithm for hiding I/O latency with improved theoretical execution-time bounds over prior work, implemented and tested in a Cilk-F prototype.
In ACM 2000 Conference on Java Grande
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Reduced I/O Latency with Futures
Presents a futures-based algorithm for hiding I/O latency with improved theoretical execution-time bounds over prior work, implemented and tested in a Cilk-F prototype.