Sökning: "Grafpartitionering"
Hittade 4 uppsatser innehållade ordet Grafpartitionering.
1. Highly Available Task Scheduling in Distinctly Branched Directed Acyclic Graphs
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)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. Streaming Graph Partitioning with Graph Convolutional Networks
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)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
3. WinBro: A Window and Broadcast-based Parallel Streaming Graph Partitioning Framework for Apache Flink
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : The past years have shown an increasing demand to process data of various kinds and size in real-time. A common representation for many real-world scenarios is a graph, which shows relations between entities, such as users of social networks or pages on the Internet. LÄS MER
4. Clustering in Financial Markets : A Network Theory Approach
Master-uppsats, KTH/Optimeringslära och systemteoriSammanfattning : In this thesis we consider graph partition of a particular kind of complex networks referred to as power law graphs. In particular, we focus our analysis on the market graph, constructed from time series of price return on the American stock market. LÄS MER
