Essays about: "skewed parallel"
Showing result 1 - 5 of 7 essays containing the words skewed parallel.
-
1. A systematic performance study of the parallel programming framework SkePU 3 using HPC-benchmarks
University essay from Linköpings universitet/Programvara och systemAbstract : With hardware performance no longer following Moore’s law, software optimization becomes more important. In this paper, we discuss parallel programming, which is one way to optimize software. However, writing parallel code is considered more difficult than writing sequential code. READ MORE
-
2. Predictive Maintenance of DC Capacitors in STATCOMs
University essay fromAbstract : To further improve the reliability of STATCOM solutions a predictive maintenance system can give the user valuable readings of capacitor health an online and non-invasive, and especially readings of individual capacitors. This allows the user to replace individual deteriorating capacitor links in an MMC configuration before triggering any safety system. READ MORE
-
3. Hardware Utilisation Techniques for Data Stream Processing
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Recent years have seen an increase in use of the stream processing architecture to compose continuous analytics applications. This thesis presents the design of a Rust-based stream processor that adopts two separate techniques to tackle existing weaknesses in modern production-grade stream processors. READ MORE
-
4. Sort Merge Buckets: Optimizing Repeated Skewed Joins in Dataflow
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : The amount of data being generated and consumed by today’s systems and applications is staggering and increasing at a vertiginous rate. Many businesses and entities rely on the analysis and the insights gained from this data to deliver their service. READ MORE
-
5. Streaming Graph Partitioning : Degree Project in Distributed Computing at KTH Information and Communication Technology
University essay from KTH/Skolan för informations- och kommunikationsteknik (ICT)Abstract : Graph partitioning is considered to be a standard solution to process huge graphs efficiently when processing them on a single machine becomes inefficient due to its limited computation power and storage space. In graph partitioning, the whole graph is divided among different computing nodes that process the graph in parallel. READ MORE