Essays about: "kompilatoroptimering"

Found 3 essays containing the word kompilatoroptimering.

  1. 1. Throughput Analysis of Safepoint-attached Barriers in a Low-latency Garbage Collector : Analysis of a Compiler Optimization in the HotSpot JVM

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Filip Wilén; [2023]
    Keywords : Garbage Collection; Compiler; Java; JVM; Concurrency; Benchmarking; Skräpsamlare; Kompilatorer; Java; JVM; Multitrådat; Benchmarking;

    Abstract : When using managed programming languages, there is an essential benefit in having a fast and efficient compiler and garbage collector; one garbage collector currently under development is the HotSpot low-latency concurrent Generational Z Garbage Collector. Concurrent memory management runs application threads and garbage collection threads simultaneously. READ MORE

  2. 2. Compiler optimization VS WCET : Battle of the ages

    University essay from Linköpings universitet/Institutionen för datavetenskap

    Author : Tova Harrius; Max Nordin; [2022]
    Keywords : Compiler; Optimization; Worst Case Execution Time; Kompilator; Optimering; WCET;

    Abstract : Optimization by a compiler can be executed with many different methods. The defence company Saab provided us with a mission, to see if we could optimize their code with the help of the GCC compiler and its optimization flags. For this thesis we have conducted a study of the optimization flags to decrease the worst case execution time. READ MORE

  3. 3. Static Branch Prediction through Representation Learning

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Pietro Alovisi; [2020]
    Keywords : compiler; compiler optimization; branch prediction; machine learning; representation learning; LLVM; kompilator; kompilatoroptimering; branch prediction; maskininlärning; representation learning; LLVM.;

    Abstract : In the context of compilers, branch probability prediction deals with estimating the probability of a branch to be taken in a program. In the absence of profiling information, compilers rely on statically estimated branch probabilities, and state of the art branch probability predictors are based on heuristics. READ MORE