Sökning: "work-stealing"
Visar resultat 1 - 5 av 10 uppsatser innehållade ordet work-stealing.
1. Parallel Query Systems : Demand-Driven Incremental Compilers
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : Query systems were recently introduced as an architecture for constructing compilers, and have shown to enable fast and efficient incremental compilation, where results from previous builds is reused to accelerate future builds. With this architecture, a compiler is composed of several queries, each of which extracts a small piece of information about the source program. LÄS MER
2. Applying Stateless Model Checking to Work-Stealing libraries
Master-uppsats, Uppsala universitet/Institutionen för informationsteknologiSammanfattning : Software verification by testing does not always detect concurrency errors. Software verification by Stateless Model Checking searches the state space more systematically than testing and can therefore detect concurrency errors which may not be found by testing alone. LÄS MER
3. Parallelization in Rust with fork-join and friends: Creating the fork-join framework
H-uppsats,Sammanfattning : This 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. LÄS MER
4. Förbättring av mjukvarubibliotek för parallellberäkningar med programmeringsmodellen Chunks and Tasks
Kandidat-uppsats, Uppsala universitet/Avdelningen för beräkningsvetenskapSammanfattning : Chunks and Tasks is a programming model based on the C ++ programming language. This programming model is used for electronic structure calculations, among other things. LÄS MER
5. Implementing Confidence-based Work Stealing Search in Gecode
Uppsats för yrkesexamina på grundnivå, KTH/Skolan för informations- och kommunikationsteknik (ICT)Sammanfattning : Constraint programming is a field whose goal is to solve extremely large problems with a set of restrictions that define the problem. One such example is generating CPU instructions from source code, because a compiler must choose the optimal instructions that best matches the source code, schedule them optimally to minimize the amount of time it takes to execute the instructions and possibly at the same time also minimize power consumption. LÄS MER