Sökning: "Multiprocessor"

Visar resultat 1 - 5 av 52 uppsatser innehållade ordet Multiprocessor.

  1. 1. Optimizing Energy Consumption in a Real-Time System Using Artificial Intelligence

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

    Författare :Caroline Lisa Pereira; [2023]
    Nyckelord :;

    Sammanfattning : In energy-efficient real-time embedded system design, the objective is to reduce energy consumption while meeting the tasks' timing requirements. Real-time Dynamic Voltage and Frequency Scaling (DVFS) methods aim at achieving this by scaling the frequency at which a single processor or multiple processors in the system operate, but they often assume that the tasks' deadlines are known and their arrival times are regular. LÄS MER

  3. 2. Measurement-based WCET estimation in multicore real-time systems

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

    Författare :Sören Meinken; [2022]
    Nyckelord :;

    Sammanfattning : Increasing complexity and advancements of hardware continue to make WCET analysis a non-trivial problem especially on modern COTS processors. Finding a tightand reliable WCET upper bound is vital for schedulability analysis and increasing theresource utilization of a real-time system. LÄS MER

  4. 3. Software Architecture for Concurrency Analysis on a Virtual Platform

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

    Författare :Brinda Mohan; [2022]
    Nyckelord :;

    Sammanfattning : With the increasing demand for faster processing, a trend of moving towards multi-core and multiprocessor environments for embedded systems is clear. In this context, concurrent programming is also on the rise. LÄS MER

  5. 4. Implementation of a Fast Approximation Algorithm for Precedence Constrained Scheduling

    Master-uppsats, Linköpings universitet/Tillämpad matematik; Linköpings universitet/Tekniska fakulteten

    Författare :Måns Alskog; [2022]
    Nyckelord :Optimization; scheduling; approximation algorithms; linear programming; multiplicative weight update; Optimering; schemaläggning; approximationsalgoritmer; linjärprogrammering;

    Sammanfattning : We present an implementation of a very recent approximation algorithm for scheduling jobs on a single machine with precedence constraints, minimising the total weighted completion time. We also evaluate the performance of this implementation. LÄS MER

  7. 5. Using maximal feasible subset of constraints to accelerate a logic-based Benders decomposition scheme for a multiprocessor scheduling problem

    Master-uppsats, Linköpings universitet/Tillämpad matematik; Linköpings universitet/Tekniska fakulteten

    Författare :Alexander Grgic; Filip Andersson; [2022]
    Nyckelord :logic-based Benders decomposition; maximal feasible subset of constraints; irreducible infeasible subset of constraints; multiprocessor scheduling;

    Sammanfattning : Logic-based Benders decomposition (LBBD) is a strategy for solving discrete optimisation problems. In LBBD, the optimisation problem is divided into a master problem and a subproblem and each part is solved separately. LÄS MER