Sökning: "schemaläggning algoritm"

Visar resultat 1 - 5 av 26 uppsatser innehållade orden schemaläggning algoritm.

1. 1. Optimizing the instruction scheduler of high-level synthesis tool

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

   Författare :Zihao Xu; [2023]
   Nyckelord :Instruction scheduling; Scheduling algorithm; CGRA; High-level Sythnesis; SiLago; Algorithm-level Synthesis; Constraint programming; Instruktion schemaläggning; schemaläggning algoritm; CGRA; High-level Sythnesis; SiLago; Algoritm-nivå Synthesis; Constraint programmering;

   Sammanfattning : With the increasing complexity of the chip architecture design for meeting different application requirements, the corresponding instruction scheduler of high-level synthesis tool needs to solve complex scheduling problems. Dynamically Reconfigurable Resource Array (DRRA) is a novel architecture based on Coarse-Grained Reconfigurable Architecture (CGRA) on SiLago platform, the instruction scheduler of Vesyla-II, the dedicated High-Level Synthesis (HLS) tool targets for DRRA needs to schedule the specific instruction sets designed for Distributed Two-level Control System (D2LC). LÄS MER

3. 2. Simultaneous scheduling of railway maintenance and trains : Modelling and solving train interactions close to a maintenance operation

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

   Författare :Pauline Vaillant; [2023]
   Nyckelord :Optimization; Linear programming; Heuristics; Railway scheduling; Maintenance planning; Optimering; Linjärprogrammering; Heuristik; Järnvägsplanering; Underhållsplanering;

   Sammanfattning : Rail transport plays a key role in the mobility of passengers and goods. It is expected to grow the decarbonization of society. In that context, it is important to use the railway network efficiently, and jointly planning trains and network maintenance allows for better use of resources. LÄS MER

4. 3. Implementation and evaluation of TSN scheduling algorithms

   Kandidat-uppsats, Karlstads universitet/Institutionen för matematik och datavetenskap (from 2013)

   Författare :Emanuel Svensson; [2023]
   Nyckelord :time-sensitive networking; real-time applications; time-sensitive networks;

   Sammanfattning : Time Sensitive Networking (TSN) is a standard that extends Ethernet, providing deterministic guarantees to internal communications. The standard is finding use in many different fields such as modern cars whose networks are getting increasingly complex. LÄS MER

5. 4. Randomized heuristic scheduling of electrical distribution network maintenance in spatially clustered balanced zones

   Master-uppsats, KTH/Geoinformatik

   Författare :Carolina Offenbacher; Ellen Thornström; [2022]
   Nyckelord :Capacitated Vehicle Routing Problem; Electrical distribution network; Heuristic algorithm; Scheduling; Handelsresandeproblemet; Eldistributionsnätverk; Heurustik algortim; Schemaläggning;

   Sammanfattning : Reliable electricity distribution systems are crucial; hence, the maintenance of such systems is highly important, and in Sweden strictly regulated. Poorly planned maintenance scheduling leads unnecessary driving which contributes to increased emissions and costs. LÄS MER

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