Sökning: "Graph Partitioning"

Visar resultat 1 - 5 av 18 uppsatser innehållade orden Graph Partitioning.

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

  2. 2. Simulations of Point Processes on Directed Graphs

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

    Författare :Stavroula Rafailia Vlachou; [2022]
    Nyckelord :;

    Sammanfattning : Simulating a point process where the events correspond to vehicle collisions on a road networkcan be quite computationally heavy due to the large number of elements that are necessary toprovide a sufficient discretization of the network. This paper aims to present a computationallyefficient solution for simulating events of a point process. LÄS MER

  3. 3. Place and Route Algorithms for a Neuromorphic Communication Network Simulator

    Master-uppsats, Linköpings universitet/Datorteknik

    Författare :Fredrik Pettersson; [2021]
    Nyckelord :Neuromorphic computing; graph partitioning; neuron; simulator; placement; Neuromorphic Communication Network;

    Sammanfattning : In recent years, neural networks have seen increased interest from both the cognitive computing and computation neuroscience fields. Neuromorphic computing systems simulate neural network efficiently, but have not yet reached the amount of neurons that a mammal has. LÄS MER

  4. 4. Approaching sustainable mobility utilizing graph neural networks

    Uppsats för yrkesexamina på avancerad nivå, Högskolan i Halmstad/Akademin för informationsteknologi

    Författare :Robin Gunnarsson; Alexander Åkermark; [2021]
    Nyckelord :Graph neural network; GNN; sustainable mobility; GCN; graph; Neural network; Cora; Fuel consumption prediction; graph;

    Sammanfattning : This report is done in collaboration with WirelessCar for the master of science thesis at Halmstad University. Many different parameters influence fuel consumption. The objective of the report is to evaluate if Graph neural networks are a practical model to perform fuel consumption prediction on areas. LÄS MER

  5. 5. Streaming Graph Partitioning with Graph Convolutional Networks

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

    Författare :Michal Zwolak; [2020]
    Nyckelord :;

    Sammanfattning : In this work, we present a novel approach to the streaming graph partitioning problem which handles unbounded streams.Graph partitioning is a process of dividing a graph into groups of nodes or edges. LÄS MER