A Pipelining Approach to Informed Prefetching in Distributed Multi-level Storage Systems

Assaf, Maen M. Al; Alghamdi, Mohammed I.; Jiang, Xunfei; Zhang, Ji; Qin, Xiao

doi:10.1109/nca.2012.26

Cited by 8 publications

(9 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hint-K [22][23] uses the k-step hint history information of both demote and promote operations, which can efficiently describe the activeness of data blocks. In addition, with the development of tiered storage [49] , unified single level cache algorithms (e.g., UARC [17] ) are another way to provide a comprehensive solution for hybrid memory systems.…”

Section: Multilevel Cache Algorithmsmentioning

confidence: 99%

A Hint Frequency Based Approach to Enhancing the I/O Performance of Multilevel Cache Storage Systems

Meng

Guo

et al. 2017

J. Comput. Sci. Technol.

View full text Add to dashboard Cite

Meng XD, Wu CT, Guo MY et al. A hint frequency based approach to enhancing the I/O performance of multilevel cache storage systems. AbstractWith the enormous and increasing user demand, I/O performance is one of the primary considerations to build a data center. Several new technologies in data centers, such as tiered storage, prompt the widespread usage of multilevel cache techniques. In these storage systems, the upper level storage typically serves as a cache for the lower level, which forms a distributed multilevel cache system. However, although many excellent multilevel cache algorithms have been proposed to improve the I/O performance, they still have potential to be enhanced by investigating the history information of hints. To address this challenge, in this paper, we propose a novel hint frequency based approach (HFA), to improve the overall multilevel cache performance of storage systems. The main idea of HFA is using hint frequencies (the total number of demotions/promotions by employing demote/promote hints) to efficiently explore the valuable history information of data blocks among multiple levels. HFA can be applied with several popular multilevel cache algorithms, such as Demote, Promote and Hint-K. Simulation results show that, compared with original multilevel cache algorithms such as Demote, Promote and Hint-K, HFA can improve the I/O performance by up to 20% under different I/O workloads.

show abstract

Section: Multilevel Cache Algorithmsmentioning

confidence: 99%

A Hint Frequency Based Approach to Enhancing the I/O Performance of Multilevel Cache Storage Systems

Meng

Guo

et al. 2017

J. Comput. Sci. Technol.

View full text Add to dashboard Cite

show abstract

“…In [1] [6] [7], we proposed several informed prefetching mechanisms for hybrid storage systems. Our observations show that there exist some problems with informed prefetching like: application must provide hints, there should be a lead time to ensure file is prefetched, and informed prefetching is not good for multiple executables.…”

Section: Motivationsmentioning

confidence: 99%

“…As we did in [1] [6] [7], let us consider a simple hybrid storage system, where there are two-level disk array composed of an SSD (top) and an HDD (bottom). All of the data blocks can initially be distributed between the two levels.…”

Section: Data Initial Placementmentioning

confidence: 99%

Predictive Prefetching for Parallel Hybrid Storage Systems

Assaf¹

2015

IJCNS

View full text Add to dashboard Cite

In this paper, we present a predictive prefetching mechanism that is based on probability graph approach to perform prefetching between different levels in a parallel hybrid storage system. The fundamental concept of our approach is to invoke parallel hybrid storage system's parallelism and prefetch data among multiple storage levels (e.g. solid state disks, and hard disk drives) in parallel with the application's on-demand I/O reading requests. In this study, we show that a predictive prefetching across multiple storage levels is an efficient technique for placing near future needed data blocks in the uppermost levels near the application. Our PPHSS approach extends previous ideas of predictive prefetching in two ways: (1) our approach reduces applications' execution elapsed time by keeping data blocks that are predicted to be accessed in the near future cached in the uppermost level; (2) we propose a parallel data fetching scheme in which multiple fetching mechanisms (i.e. predictive prefetching and application's on-demand data requests) can work in parallel; where the first one fetches data blocks among the different levels of the hybrid storage systems (i.e. low-level (slow) to high-level (fast) storage devices) and the other one fetches the data from the storage system to the application. Our PPHSS strategy integrated with the predictive prefetching mechanism significantly reduces overall I/O access time in a hybrid storage system. Finally, we developed a simulator to evaluate the performance of the proposed predictive prefetching scheme in the context of hybrid storage systems. Our results show that our PPHSS can improve system performance by 4% across real-world I/O traces without the need of using large size caches.

show abstract

“…As we did in [3], [4], and [22], we use LASR real world trace [23] that represent an application that issues 11,686 I/O data read requests of about 800 distinct data blocks. Trace used in our experiments represents an application that performs a few overhead processing operations that consume a very tiny CPU processing time between each two subsequent I/O data requests.…”

Section: Assumptionsmentioning

confidence: 99%

A Comparison Study between Informed and Predictive Prefetching Mechanisms for I/O Storage Systems

Assaf

Rodan²,

Qatawneh³

et al. 2015

IJCNS

View full text Add to dashboard Cite

In this paper, we present a comparative study between informed and predictive prefetching mechanisms that were presented to leverage the performance gap between I/O storage systems and CPU. In particular, we will focus on transparent informed prefetching (TIP) and predictive prefetching using probability graph approach (PG). Our main objective is to show the main features, motivations, and implementation overview of each mechanism. We also conducted a performance evaluation discussion that shows a comparison between both mechanisms performance when using different cache size values.

show abstract

A Pipelining Approach to Informed Prefetching in Distributed Multi-level Storage Systems

Cited by 8 publications

References 15 publications

A Hint Frequency Based Approach to Enhancing the I/O Performance of Multilevel Cache Storage Systems

A Hint Frequency Based Approach to Enhancing the I/O Performance of Multilevel Cache Storage Systems

Predictive Prefetching for Parallel Hybrid Storage Systems

A Comparison Study between Informed and Predictive Prefetching Mechanisms for I/O Storage Systems

Contact Info

Product

Resources

About