Essays about: "scheduling algorithms"

Showing result 1 - 5 of 83 essays containing the words scheduling algorithms.

  1. 1. Improving the performance of GPU-accelerated spatial joins

    University essay from KTH/Skolan för informations- och kommunikationsteknik (ICT)

    Author : Dusan Viktor Hrstic; [2017]
    Keywords : GPU-acceleration; spatial joins; threads optimizations; warp scheduling; GPU-acceleration; rumsliga föreningar; optimering av trådar; warp schedulering;

    Abstract : Data collisions have been widely studied by various fields of science and industry. Combing CPU and GPU for processing spatial joins has been broadly accepted due to the increased speed of computations. READ MORE

  2. 2. Wireless system design : NB-IoT downlink simulator

    University essay from Uppsala universitet/Signaler och System; Uppsala universitet/Signaler och System

    Author : Piotr Krasowski; Douglas Troha; [2017]
    Keywords : nb-iot; lte; lte-a; downlink; simulator; wireless;

    Abstract : The newly defined NB-IoT standard currently lacks a toolkit and simulator. In order to develop algorithms for this new standard there is a need for channels and signals as reference during tests. MATLAB is commonly used for testing LTE signals and therefore the toolkit was developed in this environment. READ MORE

  3. 3. Application of Machine Learning techniques to Optimization algorithms

    University essay from KTH/Optimeringslära och systemteori

    Author : Geoffrey Dabert; [2017]
    Keywords : ;

    Abstract : Optimization problems have been immuned to any attempt of combination with machine learning until a decade ago but it is now an active research field. This thesis has studied the potential implementation of a machine learning heuristic to improve the resolution of the optimization scheduling problems based on a Constraint Programming solver. READ MORE

  4. 4. Analysis of task scheduling for multi-coreembedded systems

    University essay from KTH/Maskinkonstruktion (Inst.)

    Keywords : ;

    Abstract : This thesis performs a research on scheduling algorithms for parallel applications. The main focus is their usage on multi-core embedded systems’ applications. A parallel application can be described by a directed acyclic graph. READ MORE

  5. 5. Upper Bounds on the Time Complexity of Temporal CSPs

    University essay from Linköpings universitet/Institutionen för datavetenskap

    Author : Peter Stockman; [2016]
    Keywords : CSP; Algorithms;

    Abstract : The temporal constraint satisfaction problem (CSP) offers a formalized way to reason about in which order tasks should be accomplished. Using this we can model a wide set of specific problems from scheduling to AI. READ MORE