195 search results - page 17 / 39 » Analysis of speculative prefetching |
SIGMETRICS
1997
ACM
13 years 11 months ago
1997
ACM
Informed prefetching and caching based on application disclosure of future I/O accesses (hints) can dramatically reduce the execution time of I/O-intensive applications. A recent ...
HPCA
2007
IEEE
14 years 7 months ago
2007
IEEE
Task-selection policies are critical to the performance of any architecture that uses speculation to extract parallel tasks from a sequential thread. This paper demonstrates that ...
ICMCS
2005
IEEE
14 years 1 months ago
2005
IEEE
VOD services require the storage system support with multiple disks. SCSI-based systems are usual choices. However, disks can be attached directly to networks these days. Fiber Ch...
IOPADS
1997
13 years 8 months ago
1997
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
ASYNC
1997
IEEE
13 years 11 months ago
1997
IEEE
This paper presents an in-depth case study in highperformance asynchronous adder design. A recent method, called “speculative completion”, is used. This method uses single-rai...