- Page 1: conference proceedings ISBN 978-1-9
- Page 5 and 6: Program Co-Chairs Angela Demke Brow
- Page 7 and 8: Wednesday, February 24, 2016 Songs
- Page 10: Message from the FAST ’16 Program
- Page 13 and 14: co-locating related items on disk,
- Page 15 and 16: Figure 1: Late-binding journaling i
- Page 17 and 18: a.tex b.tex Zone 1 1 docs ed 0 loca
- Page 19 and 20: Rangecast unlink and truncate. In t
- Page 21 and 22: File System find grep mv rm -rf Bet
- Page 23 and 24: 7.5 Background costs This subsectio
- Page 25 and 26: [18] LU, L., ZHANG, Y.,DO, T.,AL-KI
- Page 27 and 28: econstructed, checked, and updated,
- Page 29 and 30: Variations: An alternative is to us
- Page 31 and 32: mostly metadata updates. A composit
- Page 33 and 34: [SZE05] Szeredi M. Filesystem in Us
- Page 35 and 36: that can be implemented directly ov
- Page 37 and 38: The Isotope API implicitly associat
- Page 39 and 40: Start Timestamp … Commit Abort
- Page 41 and 42: dress is moved from the single-vers
- Page 43 and 44: MB/sec 600 500 400 300 200 100 0 Di
- Page 45 and 46: MB/sec 500 400 300 200 100 0 Disk e
- Page 47 and 48: [27] R. M. English and A. A. Stepan
- Page 50 and 51: BTrDB: Optimizing Storage System De
- Page 52 and 53:
lar benchmark [9] comparing MongoDB
- Page 54 and 55:
tistical aggregates are computed as
- Page 56 and 57:
cal deltas are typically removed wi
- Page 58 and 59:
eads, despite having a higher read
- Page 60 and 61:
(a) Latency Figure 7: Throughput as
- Page 62 and 63:
Acknowledgments The authors would l
- Page 64 and 65:
Environmental Conditions and Disk R
- Page 66 and 67:
(LSEs), a common type of disk failu
- Page 68 and 69:
in each datacenter. We filter the f
- Page 70 and 71:
Error Name IOCTL ATA PASS THROUGH S
- Page 72 and 73:
Linear Fit a · x + b Popul. % Temp
- Page 74 and 75:
Figure 7: AFR prediction using our
- Page 76:
References [1] AHMAD, F., AND VIJAY
- Page 79 and 80:
Model name MLC-A MLC-B MLC-C MLC-D
- Page 81 and 82:
Model name MLC-A MLC-B MLC-C MLC-D
- Page 83 and 84:
Median RBER 0e+00 3e−08 6e−08 0
- Page 85 and 86:
74 14th USENIX Conference on File a
- Page 87 and 88:
Model name MLC-A MLC-B MLC-C MLC-D
- Page 89 and 90:
for the best models. We also looked
- Page 91 and 92:
Physics Symposium, 1993. 31st Annua
- Page 93 and 94:
characterizing not only the theoret
- Page 95 and 96:
ing implementation of encoding and
- Page 97 and 98:
(n,k) code in HDFS: k-1 k-2 0 HDF
- Page 99 and 100:
allows dynamical use of external er
- Page 101 and 102:
(a) HDFS. (b) Ceph with 4MB stripes
- Page 103 and 104:
traditional erasure codes initiate
- Page 105 and 106:
[31] I. Tamo, Z. Wang, and J. Bruck
- Page 107 and 108:
durability, as well as the differen
- Page 109 and 110:
H L ER (11) 1 0 ER Tmp (11) (X0) 1
- Page 111 and 112:
BER 1e-2 1e-3 1e-4 H Reprogrammed (
- Page 113 and 114:
physical page size. Thus, the FTL m
- Page 115 and 116:
Volume Requests (M) Drive size (GB)
- Page 117 and 118:
Normalized Erasures / Energy 1.3 1.
- Page 119 and 120:
Technologies (FAST), 2008. [29] R.
- Page 122 and 123:
Reducing Solid-State Storage Device
- Page 124 and 125:
overwrite times within one hour. In
- Page 126 and 127:
Figure 7: Illustration of opportuni
- Page 128 and 129:
Figure 9: Flow diagram for realizin
- Page 130 and 131:
Rdata= 0.7 Rdelta=0.6 Rdata= 0.7 Rd
- Page 132 and 133:
Table 2: Read/Update latency overhe
- Page 134 and 135:
Computers, vol. 59, no. 10, pp. 133
- Page 136 and 137:
Access Characteristic Guided Read a
- Page 138 and 139:
Average Latency(m 6 4 2 0 Low Cost
- Page 140 and 141:
Read cost regulation. A low-cost re
- Page 142 and 143:
References [1] C. Lee, D. Sim, J. H
- Page 144 and 145:
WiscKey: Separating Keys from Value
- Page 146 and 147:
ports range queries, snapshots, and
- Page 148 and 149:
Low write amplification. Write ampl
- Page 150 and 151:
To avoid losing any data if a crash
- Page 152 and 153:
Throughput (MB/s) 500 450 400 350 3
- Page 154 and 155:
Throughput (MB/s) 400 350 300 250 2
- Page 156 and 157:
5 Related Work Various key-value st
- Page 158 and 159:
man, Alex Pilchin, Swami Sivasubram
- Page 160 and 161:
Towards Accurate and Fast Evaluatio
- Page 162 and 163:
to LSM-tree with a few important di
- Page 164 and 165:
Request count Add Unique Unique key
- Page 166 and 167:
Compaction removes items from a lev
- Page 168 and 169:
Write amplification 30 25 20 15 10
- Page 170 and 171:
Write amplification 90 80 70 60 50
- Page 172 and 173:
ciently high accuracy to make meani
- Page 174 and 175:
for large-scale nonlinear programmi
- Page 176 and 177:
1 // @param L maximum level 2 // @p
- Page 178 and 179:
Efficient and Available In-memory K
- Page 180 and 181:
Client set(x, “abcd”) set(x,
- Page 182 and 183:
Node 1 M 1 D1 P2 M 1 M 2 M 3 P1 M 2
- Page 184 and 185:
data processes and the rn 1 , rn 2
- Page 186 and 187:
the data of some failed processes a
- Page 188 and 189:
Latency (us) 1000 900 800 700 600 5
- Page 190 and 191:
REFERENCES [1] B. Atikoglu, Y. Xu,
- Page 192 and 193:
Slacker: Fast Distribution with Laz
- Page 194 and 195:
Table 1: Docker Driver API.
- Page 196 and 197:
alpine ubuntu-debootstrap fedora or
- Page 198 and 199:
Percent of Images 15% 10% 5% 0% 0 7
- Page 200 and 201:
Figure 17: Push/Pull Timelines. Sla
- Page 202 and 203:
Time (Seconds) 210 180 150 120 90 6
- Page 204 and 205:
Figure 24a shows the result: most r
- Page 206:
[39] Paul van der Ende. Fast and Ea
- Page 209 and 210:
data plane efficiency. Changing the
- Page 211 and 212:
Insert (IOHeader, Delegate) Creates
- Page 213 and 214:
scenario since the sSwitch is keepi
- Page 215 and 216:
Routing across remote servers. To r
- Page 217 and 218:
# IOs 400000 350000 300000 250000 2
- Page 219 and 220:
IO Cache 1 Controller Cache 2 sSwit
- Page 221 and 222:
References [1] M. Abd-El-Malek, W.
- Page 223 and 224:
[40] D. Narayanan, A. Donnelly, and
- Page 225 and 226:
educe the complexity of designing n
- Page 227 and 228:
Failure Domains f ailurerate : [com
- Page 229 and 230:
are then all used independently to
- Page 231 and 232:
Rack #HDDs #HDDs/server #domains av
- Page 233 and 234:
CDF of configurations CDF of config
- Page 235 and 236:
and external to the rack. Tools lik
- Page 237 and 238:
[22] STORER, M. W., GREENAN, K. M.,
- Page 239 and 240:
power limit or cap. At the core of
- Page 241 and 242:
(a) Sequential Static Dynamic (b) R
- Page 243 and 244:
(a) Power vs. IOQ (b) Power vs. NCQ
- Page 245 and 246:
(a) Throughput mode (b) Tail-latenc
- Page 247 and 248:
(a) Maximized load (b) Va
- Page 249 and 250:
(a) PCAP for multiple HDDs (b) Res
- Page 251 and 252:
[34] LIM, H., KANSAL, A., AND LIU,
- Page 253 and 254:
Adaptive preallocation allocates ex
- Page 255 and 256:
Dual-Mode Journaling: Journaling me
- Page 257 and 258:
Transaction latency(Sec) Normalized
- Page 260 and 261:
Uncovering Bugs in Distributed Stor
- Page 262 and 263:
Server receive msg { case ClientReq
- Page 264 and 265:
Extent Manager 1 Network Engine Ext
- Page 266 and 267:
modeling Extent Node in P# class Ex
- Page 268 and 269:
4 Case Study: Live Table Migration
- Page 270 and 271:
P# Random Scheduler P# Priority-bas
- Page 272 and 273:
References [1] AMAZON. Summary of t
- Page 274 and 275:
The Tail at Store: A Revelation fro
- Page 276 and 277:
I/O L i = RAID D 1 Request latency
- Page 278 and 279:
1 0.995 0.99 0.985 0.98 1 0.99 (a)
- Page 280 and 281:
1 0.8 0.6 0.4 (a) CDF of RI within
- Page 282 and 283:
1 0.9 0.8 0.7 (a) CDF of RIO Degrad
- Page 284 and 285:
to tails. We set ST =2in our evalua
- Page 286 and 287:
References [1] Weak Head. http://fo
- Page 288 and 289:
Estimating Unseen Deduplication - f
- Page 290 and 291:
dataset. Note that low memory usage
- Page 292 and 293:
Figure 2: The figure depicts sampli
- Page 294 and 295:
3. Extrapolate DFH: Generate an est
- Page 296 and 297:
2. Compute CR, the average compress
- Page 298 and 299:
4 Evaluation 4.1 Implementation and
- Page 300:
Acknowledgements. We thank Evgeny L
- Page 303 and 304:
additional index block writes. It a
- Page 305 and 306:
stop issuing writes to it) to gener
- Page 307 and 308:
Hadoop Hadoop Original Dmdedup Fail
- Page 309 and 310:
References [1] M. M. Astrahan, M. W
- Page 312 and 313:
Wenji Li Arizona State University C
- Page 314 and 315:
Figure 1: Architecture of CacheDedu
- Page 316 and 317:
Symbol D d M m p i g i a i f (p i )
- Page 318 and 319:
Algorithm 2: D-ARC(C, X) pseudocode
- Page 320 and 321:
Total Miss Ratio (%) 20 18 16 14 12
- Page 322 and 323:
Read Miss Ratio (%) 120 110 100 90
- Page 324 and 325:
References [1] Fio — Flexible I/O
- Page 326 and 327:
Using Hints to Improve Inline Block
- Page 328 and 329:
might increase the latency of those
- Page 330 and 331:
Elapsed time (secs) 180 160 140 120
- Page 332 and 333:
References [1] L. Aronovich, R. Ash
- Page 334 and 335:
NOVA: A Log-structured File System
- Page 336 and 337:
systems [21, 71, 73] bypass the DRA
- Page 338 and 339:
each log page. Allowing for non-seq
- Page 340 and 341:
Directory dentry tree dir File radi
- Page 342 and 343:
does not copy the live entries in p
- Page 344 and 345:
Figure 6: File system operation lat
- Page 346 and 347:
Acknowledgments This work was suppo
- Page 348 and 349:
ing Crash-Consistent Applications.
- Page 350 and 351:
Application-Managed Flash Sungjin L
- Page 352 and 353:
A segment is allocated when the fir
- Page 354 and 355:
Figure 4: To find an inode, ALFS fi
- Page 356 and 357:
Figure 7: An example of how AFTL ha
- Page 358 and 359:
Throughput (GB/s) 2 1.5 1 0.5 0 EXT
- Page 360 and 361:
Requests per second (Log) 10000 100
- Page 362 and 363:
Direct Flash Management without FTL
- Page 364:
[38] MIN, C., KIM, K., CHO, H.,LEE,
- Page 367 and 368:
Cache is then able to allocate the
- Page 369 and 370:
Hit Ratio (%) Cache Usage (%) Flash
- Page 371 and 372:
portion of the main memory as the s
- Page 373 and 374:
Hit Ratio (%) 100 Allocation (GB) 2
- Page 375 and 376:
virtual block device to physical de
- Page 377 and 378:
ent cache load. It then evaluates a
- Page 379 and 380:
References [1] Fusion-io ioCache. h