Sökning: "Compiler Architecture"

Visar resultat 1 - 5 av 46 uppsatser innehållade orden Compiler Architecture.

1. 1. 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

3. 2. 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

4. 3. Prototyping an mcSAT-based SMTsolver in Rust

   Master-uppsats, Uppsala universitet/Institutionen för informationsteknologi

   Författare :Dennis Örnberg; [2022]
   Nyckelord :;

   Sammanfattning : Satisfiability modulo theories, or SMT, is the decision problem of determining whether a set of formulas is satisfiable or not, given one or more background theories. The model-constructing satisfiability calculus, or mcSAT, is a framework used for solving SMT problems. LÄS MER

5. 4. VM Instruction Decoding Using C Unions in Stack and Register Architectures

   Kandidat-uppsats, Malmö universitet/Institutionen för datavetenskap och medieteknik (DVMT)

   Författare :Kasper Strömberg Skott; [2022]
   Nyckelord :virtual machine; VM; interpreter; VM interpreter; VM architecture; instruction decoding; instruction dispatch; union;

   Sammanfattning : The architecture of virtual machine (VM) interpreters has long been a subject of researchand discussion. The initial trend of stack-based interpreters was shortly thereafterchallenged by research showing the performance advantages of virtual register machines. LÄS MER

7. 5. Configurable, scalable single-ended sense amplifier with additional auxiliary blocks for low-power two-port memories in advanced FinFET technologies

   Master-uppsats, Lunds universitet/Institutionen för elektro- och informationsteknik

   Författare :Limitha Subbaiah Kumar Nangaru; [2022]
   Nyckelord :CMOS Complementary Metal Oxide Semiconductors ; DRC Design Rule Check ; Process Corners; FinFET Fin Field Effect Transistor ; IC Integrated Circuit ; LVS Layout Versus Schematic ; Monte Carlo; Nominal Voltage; PDK Process Design Kit ; Power Delay Product; Read Bit Line; Read Word Line; SoC System on Chip ; SRAM Static Random Access Memory ; Threshold Voltage; Technology and Engineering;

   Sammanfattning : System on Chip (SoC) designs contain a variety of Intellectual Property (IP) cores, including digital signal processing blocks, media and graphics processing units, as well as processing core units that employ multiple-port memories to enhance performance and bandwidth. These memories allow parallel read/write operations from the same memory blocks from different ports. LÄS MER