Parallelization in Rust with fork-join and friends: Creating the fork-join framework

dc.contributor.authorFärnstrand, Linus
dc.contributor.departmentChalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers)sv
dc.contributor.departmentChalmers University of Technology / Department of Computer Science and Engineering (Chalmers)en
dc.date.accessioned2019-07-03T13:42:24Z
dc.date.available2019-07-03T13:42:24Z
dc.date.issued2015
dc.description.abstractThis thesis describes the design, implementation and benchmarking of a work stealing fork-join library, called ForkJoin, for the new language Rust. Rust is a programming language with a novel approach to memory safety and concurrency, and guarantees memory safety through zero-cost abstractions and thorough checks at compile time rather than run time. Rust is very well suited for computationally intensive applications, but it is lacking some basic tools for creating parallelism, something that is essential for utilizing modern hardware. This paper takes existing algorithms for fork-join parallelism and work stealing and implements them in Rust. The resulting library provides a safe and fast interface to a fork-join thread pool with low work overhead and a good ability to scale up to many processors. Inspiration for the implementation done during this project comes partly from Cilk, a work stealing fork-join framework for C, but also from other, more modern papers within the same topic. Three main types of algorithms that fit fork-join parallelism are identified and discussed in this report. This thesis and the design and implementation of ForkJoin, focuses on providing a simple framework for working with these different algorithms, in spite of their internal differences.
dc.identifier.urihttps://hdl.handle.net/20.500.12380/219016
dc.language.isoeng
dc.setspec.uppsokTechnology
dc.subjectData- och informationsvetenskap
dc.subjectComputer and Information Science
dc.titleParallelization in Rust with fork-join and friends: Creating the fork-join framework
dc.type.degreeExamensarbete för masterexamensv
dc.type.degreeMaster Thesisen
dc.type.uppsokH
local.programmeComputer science – algorithms, languages and logic (MPALG), MSc
Ladda ner
Original bundle
Visar 1 - 1 av 1
Hämtar...
Bild (thumbnail)
Namn:
219016.pdf
Storlek:
2.95 MB
Format:
Adobe Portable Document Format
Beskrivning:
Fulltext