2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST) 2010
DOI: 10.1109/msst.2010.5496999
|View full text |Cite
|
Sign up to set email alerts
|

Automated lookahead data migration in SSD-enabled multi-tiered storage systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2010
2010
2019
2019

Publication Types

Select...
5
2
2

Relationship

2
7

Authors

Journals

citations
Cited by 30 publications
(13 citation statements)
references
References 3 publications
0
13
0
Order By: Relevance
“…This SAS subsystem is architected to enable the benefits of the IBM System Storage Easy Tier [10]. IBM System Storage* Easy Tier is an IBM technology that automatically and dynamically manages the placement and access of data on subsystems with SSDs and HDDs.…”
Section: Ssd and Hdd Direct-attached Storage Subsystemmentioning
confidence: 99%
“…This SAS subsystem is architected to enable the benefits of the IBM System Storage Easy Tier [10]. IBM System Storage* Easy Tier is an IBM technology that automatically and dynamically manages the placement and access of data on subsystems with SSDs and HDDs.…”
Section: Ssd and Hdd Direct-attached Storage Subsystemmentioning
confidence: 99%
“…Understanding hotspot characteristics is essential to data placement strategies, such as caching at host or storage server by utilizing the "recency" [23], [2], and tiering by exploring the "frequency" aspect [24], [3].…”
Section: B Hotspot Characterizationmentioning
confidence: 99%
“…Performance optimization in enterprise storage systems has primarily relied on the ability to isolate and control workloads that were relatively well understood [1], [2], [3], [4]. With virtualized environments and cloud implementations, enterprise storage systems have to support a mixture of a large number of disparate workloads from a variety of applications [5], [6], [7].…”
Section: Introductionmentioning
confidence: 99%
“…The quesiton becomes how to decide the optimal lookahead length. In [4], we proposed a greedy algorithm, which can compute a near optimal lookahead length depending on the granularity used. Next, we build a formal model on the system utility optimization using lookahead migration and derive the approach to compute the optimal lookahead length precisely.…”
Section: A Lookahead Migrationmentioning
confidence: 99%