Sökning: "multiprocessor scheduling"

Visar resultat 1 - 5 av 16 uppsatser innehållade orden multiprocessor scheduling.

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

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

  4. 3. A comparison of sequencing formulations in a constraint generation procedure for avionics scheduling

    Kandidat-uppsats, Linköpings universitet/Optimeringslära; Linköpings universitet/Tekniska fakulteten

    Författare :Jessika Boberg; [2017]
    Nyckelord :Scheduling; avionics scheduling; multiprocessor scheduling; mixed integer programming;

    Sammanfattning : This thesis compares different mixed integer programming (MIP) formulations for sequencing of tasks in the context of avionics scheduling. Sequencing is a key concern in many discrete optimisation problems, and there are numerous ways of accomplishing sequencing with different MIP formulations. LÄS MER

  5. 4. Limited Preemptive Earliest Deadline First Scheduling of Real-Time Tasks on Multiprocessors

    Magister-uppsats, Mälardalens högskola/Inbyggda system

    Författare :Kaiqian Zhu; [2015]
    Nyckelord :;

    Sammanfattning : Real-time systems are employed in many areas, such as aerospace and defenses. In real-time systems, especially in hard real-time systems, it is important to meet the associated time requirements. With the increasing demand for high speed processing capabilities, the requirement for high computing power is becoming more and more urgent. LÄS MER

  7. 5. Multiprocessor Scheduling of Synchronous Data Flow Graphs using Local Search Algorithms

    Uppsats för yrkesexamina på avancerad nivå, KTH/Skolan för informations- och kommunikationsteknik (ICT)

    Författare :Emma Callerström; Kajsa Elfström; [2014]
    Nyckelord :;

    Sammanfattning : Design space exploration (DSE) is the process of exploring design alternatives before implementing real-time multiprocessor systems. One part of DSE is scheduling of the applications the system is developed for and to evaluate the performance to ensure that the real-time requirements are satisfied. LÄS MER