Sökning: "Task partitioning"

Visar resultat 1 - 5 av 18 uppsatser innehållade orden Task partitioning.

  1. 1. Time-Triggered Execution of 3-Phase Tasks on the RP2040 — A Framework Avoiding Memory Contention by Design

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

    Författare :Everita Annemarija Samusa; [2023]
    Nyckelord :Commercial-off-the-shelf; Execution framework; Multi-core; Real-time; 3- phase tasks; Kommersiell standard; Ramverk för utförande; Flerkärnig; Realtid; 3-fas uppgifter;

    Sammanfattning : Multi-core processors have emerged as an effective solution for handling complex tasks that cannot be efficiently processed by unicore processors. Their usage is driven by the potential to achieve high processing power while minimizing power consumption. LÄS MER

  2. 2. Highly Available Task Scheduling in Distinctly Branched Directed Acyclic Graphs

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

    Författare :Patrik Zhong; [2023]
    Nyckelord :Distributed Scheduling; Fault-tolerance; Graph Partitioning; Task Graphs; Dask; Dask Distributed; Data Processing; Distribuerad Schemaläggning; Feltolerans; Grafpartitionering; Uppgiftsgrafer; Dask; Dask Distributed; Dataprocessering;

    Sammanfattning : Big data processing frameworks utilizing distributed frameworks to parallelize the computing of datasets have become a staple part of the data engineering and data science pipelines. One of the more known frameworks is Dask, a widely utilized distributed framework used for parallelizing data processing jobs. LÄS MER

  3. 3. Fair Partitioning of Procedurally Generated Game Maps for Grand Strategy Games

    Master-uppsats, Umeå universitet/Institutionen för datavetenskap

    Författare :Jens Ottander; [2022]
    Nyckelord :Procedural map generation; Constrained optimization; Categorical optimization; Multiobjective optimization; Genetic algorithms; NSGA-III; MOEA D-IEpsilon; Grand Strategy Games; Partitioning; Multiplayer Games;

    Sammanfattning : Due to the high cost of manual content creation within the game development industry, methods for procedural generation of content such as game maps and levels have emerged. However, methods for generating game maps have remained relatively unexplored in competitive multiplayer contexts. LÄS MER

  4. 4. Machine Unlearning and hyperparameters optimization in Gaussian Process regression

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

    Författare :Matthis Manthe; [2021]
    Nyckelord :GDPR; Machine Unlearning; Data removal; Gaussian Process Regression; Product-of-Experts.; RGPD; Désapprentissage; Suppression de données; Gaussian Process regression; Product-of-Experts.; DSF; avlärningen; dataraderingen; Gaussian Process regression; Produkt-av-experter.;

    Sammanfattning : The establishment of the General Data Protection Regulation (GDPR) in Europe in 2018, including the "Right to be Forgotten" poses important questions about the necessity of efficient data deletion techniques for trained Machine Learning models to completely enforce this right, since retraining from scratch such models whenever a data point must be deleted seems impractical. We tackle such a problem for Gaussian Process Regression and define in this paper an efficient exact unlearning technique for Gaussian Process Regression which completely include the optimization of the hyperparameters of the kernel function. LÄS MER

  5. 5. Birds' Flight Range. : Sensitivity Analysis.

    Master-uppsats, Linköpings universitet/Institutionen för datavetenskap

    Författare :Brian Masinde; [2020]
    Nyckelord :Flight; Sensitivity Analysis; Sobol indices; meta-modelling; quasi-Monte Carlo method;

    Sammanfattning : ’Flight’ is a program that uses flight mechanics to estimate the flight range of birds. This program, used by ornithologists, is only available for Windows OS. It requires manual imputation of body measurements and constants (one observation at a time) and this is time-consuming. LÄS MER