Improving I/O response times via prefetching and storage system reorganization

Chee, C.L.; Lü, Hongjun; Tang, Hong; Ramamoorthy, C. V.

doi:10.1109/cmpsac.1997.624777

Cited by 3 publications

(4 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…I/O prefetching is an important optimization for improving performance [21], [19], [27], [26], [12], [5], [14], [18], [7]. However, I/O prefetching is known to be very sensitive to timing as pointed out by prior research [19].…”

Section: Urgency-aware I/o Prefetchingmentioning

confidence: 99%

On Urgency of I/O Operations

Kandemir

Yemliha

Prabhakar

2012

2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (Ccgrid 2012)

View full text Add to dashboard Cite

Many high-performance parallel file systems and storage hierarchies employ multilayer storage caches in an attempt to reduce data access latencies. In current storage cache hierarchies, all data requests are treated uniformly and hit/miss characteristics are dictated only by the degree of reuse exhibited by data blocks. In reality however, different I/O operations may have different urgencies (criticalities), and in particular, some I/O operations can be delayed without having a major impact on overall application performance. Motivated by this observation, we define the concept of I/O operation urgency (criticality) and study the critical latencies of I/O operations for a set of seven high-performance applications that manipulate disk-resident data sets. We propose and experimentally evaluate three profile-based strategies for exploiting urgent I/O operations in managing storage caches. The results collected with these schemes on both two-tier and three-tier systems indicate that significant performance improvements are possible if one could exploit urgencies of different I/O operations in managing storage caches.

show abstract

Section: Urgency-aware I/o Prefetchingmentioning

confidence: 99%

On Urgency of I/O Operations

Kandemir

Yemliha

Prabhakar

2012

2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (Ccgrid 2012)

View full text Add to dashboard Cite

show abstract

“…The overhead of collection method was not so small, at most 34%. Chee et al (1997) proposed a combination method with reorganisation and prefetch techniques. This study described a monitoring scheme and tried to detect access sequence from data access statistics; it can detect sequential access, interleaved access, and reverse access to each file.…”

Section: Database Monitoringmentioning

confidence: 99%

Online monitoring and visualisation of database structural deterioration

Hoshino

Goda

2010

IJAC

View full text Add to dashboard Cite

Structural deterioration of database is caused by updates of the database and can degrade performance seriously. Database reorganisation, which removes structural deterioration by relocating data in the secondary storage, is an administrator's headache; it is difficult to schedule reorganisation efficiently to keep acceptable performance because conventional database systems lack crucial monitoring facility of structural deterioration, with high resolution, high accuracy and low overhead. In order to make database reorganisation be easy for administrators and be autonomic in the future, the paper proposes an online database structure deterioration monitor, which can visualise structural deterioration distribution, with a novel structural deterioration model, a storage performance model and an incremental update technique. The experimental results with our prototype show that our scheme can monitor structural deterioration with an error of within 12% and with an overhead of 3% at most.

show abstract

“…While there exist several I/O prefetching algorithms published in literature [27], [31], [25], [32], [18], [5], the one used in this work is inspired by the work done by Mowry et al [25]. The original algorithm has actually been proposed for improving hardware cache behavior for memory-resident data sets [26], and has later been extended to implement I/O prefetching, targeting virtual memory based execution environments.…”

Section: Compiler-directed I/o Prefetchingmentioning

confidence: 99%

“…An instance of this situation is I/O prefetching, which is an important optimization for improving performance, as has been demonstrated in the past [27], [31], [25], [32], [18], [5]. In I/O prefetching, data is brought from the disk to the memory cache ahead of time to hide the latency of the disk access.…”

Section: Introductionmentioning

confidence: 99%

Prefetch throttling and data pinning for improving performance of shared caches

Öztürk

Son

Kandemir

et al. 2008

2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis

View full text Add to dashboard Cite

Abstract-In this paper, we (i) quantify the impact of compilerdirected I/O prefetching on shared caches at I/O nodes. The experimental data collected shows that while I/O prefetching brings some benefits, its effectiveness reduces significantly as the number of clients (compute nodes) is increased; (ii) identify interclient misses due to harmful I/O prefetches as one of the main sources for this reduction in performance with increased number of clients; and (iii) propose and experimentally evaluate prefetch throttling and data pinning schemes to improve performance of I/O prefetching. Prefetch throttling prevents one or more clients from issuing further prefetches if such prefetches are predicted to be harmful, i.e., replace from the memory cache the useful data accessed by other clients. Data pinning on the other hand makes selected data blocks immune to harmful prefetches by pinning them in the memory cache. We show that these two schemes can be applied in isolation or combined together, and they can be applied at a coarse or fine granularity. Our experiments with these two optimizations using four disk-intensive applications reveal that they can improve performance by 9.7% and 15.1% on average, over standard compiler-directed I/O prefetching and no-prefetch case, respectively, when 8 clients are used.

show abstract

Improving I/O response times via prefetching and storage system reorganization

Cited by 3 publications

References 11 publications

On Urgency of I/O Operations

On Urgency of I/O Operations

Online monitoring and visualisation of database structural deterioration

Prefetch throttling and data pinning for improving performance of shared caches

Contact Info

Product

Resources

About