Sökning: "kompilatorer"

Visar resultat 1 - 5 av 19 uppsatser innehållade ordet kompilatorer.

1. 1. Comparing the Performance of Compiled vs Interpreted RegEx

   Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Författare :Simon Hocker; Andreas Hammarstrand; [2023]
   Nyckelord :Compilers; Interpreters; Regular languages; RegEx; Performance; Kompilatorer; Tolkare; Regulära språk; RegEx; Prestanda;

   Sammanfattning : The Regular Expression (RegEx) is one of the most important computer science technologies used for searching through text. Used commonly in almost every corner of computer science that is dependent on searching, it is imperative that they are made to be efficient. Usually, RegEx are implemented through the use of a process called interpretation. LÄS MER

3. 2. Machine Learning-Based Instruction Scheduling for a DSP Architecture Compiler : Instruction Scheduling using Deep Reinforcement Learning and Graph Convolutional Networks

   Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Författare :Lucas Alava Peña; [2023]
   Nyckelord :Instruction Scheduling; Deep reinforcement Learning; Compilers; Graph Convolutional Networks; Schemaläggning av instruktioner; Deep Reinforcement Learning; kompilatorer; grafkonvolutionella nätverk;

   Sammanfattning : Instruction Scheduling is a back-end compiler optimisation technique that can provide significant performance gains. It refers to ordering instructions in a particular order to reduce latency for processors with instruction-level parallelism. LÄS MER

4. 3. Parallel Query Systems : Demand-Driven Incremental Compilers

   Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Författare :Christofer Nolander; [2023]
   Nyckelord :Query Systems; Parallelism; Incremental Computation; Compiler Architecture; Dependency Tracking; Query system; Parallelism; inkrementella beräkningar; kompilatorer; beroende spårning;

   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

5. 4. The state of WebAssembly in distributed systems : With a focus on Rust and Arc-Lang

   Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Författare :Theodor-Andrei Moise; [2023]
   Nyckelord :WebAssembly; Wasmer; Wasm; Rust; Arc-Lang; Distributed Systems; Continuous Deep Analytics; Docker containers; Performance benchmarking; WebAssembly; Wasmer; Wasm; Rust; Arc-Lang; Distributed Systems; Continuous Deep Analytics; Docker containers; Performance benchmarking;

   Sammanfattning : With the current developments in modern web browsers, WebAssembly has been a rising trend over the last four years. Aimed at replacing bits of JavaScript functionality, it attempts to bring extra features to achieve portability and sandboxing through virtualisation. LÄS MER

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

   Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Författare :Filip Wilén; [2023]
   Nyckelord :Garbage Collection; Compiler; Java; JVM; Concurrency; Benchmarking; Skräpsamlare; Kompilatorer; Java; JVM; Multitrådat; Benchmarking;

   Sammanfattning : 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. LÄS MER