Hide metadata

dc.contributor.authorAbishov, Araz Vladim Oglu
dc.date.accessioned2020-09-07T23:46:25Z
dc.date.available2020-09-07T23:46:25Z
dc.date.issued2020
dc.identifier.citationAbishov, Araz Vladim Oglu. A Vector Implementation Based On RRB-Tree for Rust. Master thesis, University of Oslo, 2020
dc.identifier.urihttp://hdl.handle.net/10852/79200
dc.description.abstractRust is a multi-paradigm system programming language focused on performance and reliability. Its rich type system offers memory and thread-safety guarantees at compile-time. Therefore, Rust forbids simultaneous sharing and mutation that sometimes is a necessary and useful pattern. A way to mitigate this limitation in Rust is to clone a value before sharing it. Naive cloning by copying, however, is an expensive operation both in terms of memory and performance. This thesis presents pvecrs, a project that contributes a vector implementation with efficient clone operation that borrows ideas from persistent data structures. The project explores novel approaches to optimize the vector's performance by leveraging Rust's ownership and borrowing rules, as well as aiming to provide a convenient, idiomatic interface familiar to developers. The proposed optimizations are evaluated and discussed based on the results of sequential and parallel test suites.eng
dc.language.isoeng
dc.subjectRust
dc.subjectParallel Vector
dc.subjectRRB-tree
dc.subjectPersistent Vector
dc.subjectRB-Tree
dc.subjectPersistent Data Structures
dc.titleA Vector Implementation Based On RRB-Tree for Rusteng
dc.typeMaster thesis
dc.date.updated2020-09-07T23:46:25Z
dc.creator.authorAbishov, Araz Vladim Oglu
dc.identifier.urnURN:NBN:no-82312
dc.type.documentMasteroppgave
dc.identifier.fulltextFulltext https://www.duo.uio.no/bitstream/handle/10852/79200/1/thesis.pdf


Files in this item

Appears in the following Collection

Hide metadata