Show simple item record

Optimizing System I/Os with Bϵ Trees

dc.identifier.urihttp://hdl.handle.net/11401/78242
dc.description.sponsorshipThis work is sponsored by the Stony Brook University Graduate School in compliance with the requirements for completion of degree.en_US
dc.formatMonograph
dc.format.mediumElectronic Resourceen_US
dc.language.isoen_US
dc.typeDissertation
dcterms.abstractWrite-optimized dictionaries (WODs) are useful building blocks for storage systems. A good WOD implementation performs both small writes and large scans efficiently; transfers data in large enough units to utilize most of the device’s available bandwidth; and aggregates many logical operations into each I/O. A Bϵ-tree is an asymptotically optimal WOD with several implementations that exhibit these desirable qualities. By analyzing three uses of Bϵ-trees in storage systems, this dissertation shows that the conventional wisdom that storage system designs must choose either efficient sequential reads or efficient random writes is false. Bϵ-tree-based storage systems overcome this perceived trade-off by deferring and applying related operations in large batches, and as a result, Bϵ-tree-based systems have well-rounded performance profiles. This dissertation details SMRTr, a Bϵ-tree-based host-managed SMR translation layer that performs random write workloads an order of magnitude faster than firmware-based SMR translation layers; BetrFS, an in-kernel Bϵ-tree-based file system that performs small writes and directory scans orders of magnitude faster than traditional file systems and performs comparably on other microbenchmark and application workloads; and derange queries, a query model that has the potential to provide the same I/O savings for queries that write optimization provides for inserts.
dcterms.available2018-06-21T13:38:41Z
dcterms.contributorPorter, Donald E.en_US
dcterms.contributorBender, Michael A.en_US
dcterms.contributorJohnson, Roben_US
dcterms.contributorZadok, Erezen_US
dcterms.contributorKuenning, Geoffen_US
dcterms.creatorJannen, William
dcterms.dateAccepted2018-06-21T13:38:41Z
dcterms.dateSubmitted2018-06-21T13:38:41Z
dcterms.descriptionDepartment of Computer Scienceen_US
dcterms.extent126 pg.en_US
dcterms.formatMonograph
dcterms.formatApplication/PDFen_US
dcterms.identifierhttp://hdl.handle.net/11401/78242
dcterms.issued2017-12-01
dcterms.languageen_US
dcterms.provenanceMade available in DSpace on 2018-06-21T13:38:41Z (GMT). No. of bitstreams: 1 Jannen_grad.sunysb_0771E_13590.pdf: 786854 bytes, checksum: 30fb5b17f59159ed29c9b7129f87a459 (MD5) Previous issue date: 12en
dcterms.subjectComputer science
dcterms.subjectB?-trees
dcterms.subjectFile systems
dcterms.subjectShingled magnetic recording
dcterms.subjectStorage
dcterms.subjectWrite optimization
dcterms.titleOptimizing System I/Os with Bϵ Trees
dcterms.titleOptimizing System I/Os with Bϵ Trees
dcterms.typeDissertation


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record