Sökning: "massively parallel algorithms"

Visar resultat 1 - 5 av 11 uppsatser innehållade orden massively parallel algorithms.

  1. 1. Study on feasibility of small-scale pumped hydro storage- A case study in Sweden

    Master-uppsats, Lunds universitet/Institutionen för energivetenskaper

    Författare :Prashant Niroula; [2023]
    Nyckelord :energy storage; pumped hydropower; electricity market; investment; new technologies; feasibility; Technology and Engineering;

    Sammanfattning : The European union has been aggressively pushing forward with policies favoring renewable sources of energy. As a result, the share of intermittent renewables in the European power grid is rising and is expected to grow even more in the coming decade. The Swedish energy agency also forecast huge growth in wind power. LÄS MER

  3. 2. Decentralized Large-Scale Natural Language Processing Using Gossip Learning

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

    Författare :Abdul Aziz Alkathiri; [2020]
    Nyckelord :gossip learning; decentralized machine learning; distributed machine learning; NLP; Word2Vec; data privacy; skvallerinlärning; decentraliserad maskininlärning; distribuerad maskininlärning; naturlig språkbehandling; Word2Vec; dataintegritet;

    Sammanfattning : The field of Natural Language Processing in machine learning has seen rising popularity and use in recent years. The nature of Natural Language Processing, which deals with natural human language and computers, has led to the research and development of many algorithms that produce word embeddings. LÄS MER

  4. 3. Is GPGPU CCL worth it? : A performance comparison between some GPU and CPU algorithms for solving connected components labeling on binary images

    Kandidat-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)

    Författare :Alex Sundström; Victor Ähdel; [2016]
    Nyckelord :;

    Sammanfattning : Connectedcomponentlabeling(CCL)isatraditionallysequentialproblem that is hard to parallelize. This report aims to test the performance of solving CCL using massively parallel hardware through GPGPU. To achieve this several CCL algorithms were researched and implemented using C++ and OpenCL. LÄS MER

  5. 4. Train Re-scheduling : A Massively Parallel Approach Using CUDA

    Master-uppsats, Blekinge Tekniska Högskola/Institutionen för datalogi och datorsystemteknik

    Författare :Anton Petersson; [2015]
    Nyckelord :scheduling algorithms; massively parallel algorithms; combinatorial optimization;

    Sammanfattning : Context. Train re-scheduling during disturbances is a time-consuming task. Modified schedules need to be found, so that trains can meet in suitable locations and delays minimized. Domino effects are difficult to manage. LÄS MER

  7. 5. Evaluation of Energy-Optimizing Scheduling Algorithms for Streaming Computations on Massively Parallel Multicore Architectures

    Uppsats för yrkesexamina på avancerad nivå, Linköpings universitet/Institutionen för datavetenskap; Linköpings universitet/Tekniska högskolan

    Författare :Johan Janzén; [2014]
    Nyckelord :Intel SCC; DVFS; Task based programming; Static scheduling; Energy efficiency; Multicore;

    Sammanfattning : This thesis describes an environment to evaluate and compare static schedulers for real pipelined streaming applications on massively parallel architectures, such as Intel Single chip Cloud Computer (SCC), Adapteva Epiphany, and Tilera TILE-Gx series. The framework allows performance comparison of schedulers in their execution time, or the energy usage of static schedules with energy models and measurements on real platform. LÄS MER