An Energy-Aware File Relocation Strategy Based on File-Access Frequency and Correlations

Hu, Cheng; Deng, Yuhui

doi:10.1007/978-3-319-27140-8_44

Cited by 4 publications

(3 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This helps the providers meet the performance requirements and save more costs, including those for data transfer, SLA violations and energy consumption. 105,106 Looking for data correlations can greatly help for this purpose. However, it is important to note that such strategies based on data correlations face the overhead of correlation mining, especially when a very large amount of data is available.…”

Section: Correlation-aware Data Replication Strategiesmentioning

confidence: 99%

“…However, if these required data were placed in the execution resource or in its adjacent resources, the number of remote data accesses as well as the time required for data access would be significantly reduced. This helps the providers meet the performance requirements and save more costs, including those for data transfer, SLA violations and energy consumption 105,106 . Looking for data correlations can greatly help for this purpose.…”

Section: Proposed Analysismentioning

confidence: 99%

See 1 more Smart Citation

Review on data replication strategies in single vs. interconnected cloud systems: Focus on data correlation‐aware strategies

Hamrouni

Mokadem

Khelifa

2023

Concurrency and Computation

View full text Add to dashboard Cite

SummaryData replication is a well‐known technique in cloud systems for enhancing availability and performance. Various strategies and surveys have been proposed in this respect. These surveys include comprehensive analysis and classifications. However, to the best of the authors' knowledge, there is no survey concentrating on strategies designed for interconnected cloud systems. In this article, we provide an in‐depth analysis of existing data replication strategies in cloud systems, covering single and interconnected clouds. We also highlight data correlation‐aware strategies as well as their key steps. Furthermore, we examine the major strategies' features such as: () addressed replication issues, () orientation towards the provider and the consumer, () consideration of the service level agreement, () consideration of cost and economic aspects, and () evaluation tools. Finally, we provide a performance analysis through extensive simulations of several replication strategies dedicated for single and interconnected clouds.

show abstract

Section: Correlation-aware Data Replication Strategiesmentioning

confidence: 99%

Section: Proposed Analysismentioning

confidence: 99%

Review on data replication strategies in single vs. interconnected cloud systems: Focus on data correlation‐aware strategies

Hamrouni

Mokadem

Khelifa

2023

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…Another way to reduce computational complexity is to set thresholds based on data access characteristics. For example, researchers proposed Mithril 20 for mining the access relation of data with large block address distances, based on the idea that most related data have similar access times 29,30 . Mithril mines the access relations among the data with the same access times.…”

Section: Background and Motivationmentioning

confidence: 99%

A data grouping model based on cache transaction for unstructured data storage systems

Zhu

Sun

et al. 2021

Int J of Intelligent Sys

View full text Add to dashboard Cite

Cache prefetching technology has become the mainstream data access optimization strategy in the Industrial Intelligent Systems (IIS) and the data centers. However, the rapidly increasing of unstructured data generates massive pairwise access relationships. Therefore, researchers have to make a choice between spatial locality and temporal locality to ensure an acceptable computational complexity. We propose cache-transaction-based data grouping model (CTDGM) to solve the problems described above by optimizing the feature representation method and grouping efficiency. First, we provide the definition of the cache transaction and propose the method for extracting the cache transaction feature (CTF). Second, we design a data chunking algorithm based on CTF and spatiotemporal locality to optimize the relationship calculation efficiency.Third, we propose CTDGM by constructing a relation graph that groups data into independent groups according to the strength of the data access relation. Based on the results of the experiment, compared with the state-of-the-art and traditional methods, our algorithm achieves an average increase in the cache hit rate of 5%-20% on the MSR, VDI-LUN, and KC

show abstract

Aggregating correlated cold data to minimize the performance degradation and power consumption of cold storage nodes

Deng

2018

J Supercomput

View full text Add to dashboard Cite

An Energy-Aware File Relocation Strategy Based on File-Access Frequency and Correlations

Cited by 4 publications

References 24 publications

Review on data replication strategies in single vs. interconnected cloud systems: Focus on data correlation‐aware strategies

Review on data replication strategies in single vs. interconnected cloud systems: Focus on data correlation‐aware strategies

A data grouping model based on cache transaction for unstructured data storage systems

Aggregating correlated cold data to minimize the performance degradation and power consumption of cold storage nodes

Contact Info

Product

Resources

About