Sökning: "Task scheduling"

Visar resultat 1 - 5 av 130 uppsatser innehållade orden Task scheduling.

  1. 1. Efficiently Solving the Exact Cover Problem in OpenMP

    Kandidat-uppsats, Umeå universitet/Institutionen för datavetenskap

    Författare :Leo Hall; [2023]
    Nyckelord :Exact Cover; openmp; parallelization;

    Sammanfattning : The exact cover problem is an NP-complete problem with many widespread use cases such as crew scheduling, railway scheduling, benchmarking as well as having applications in set theory. Existing algorithms can be slow when dealing with large datasets however. LÄS MER

  3. 2. Smart Tracking for Edge-assisted Object Detection : Deep Reinforcement Learning for Multi-objective Optimization of Tracking-based Detection Process

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

    Författare :Shihang Zhou; [2023]
    Nyckelord :Tracking-By-Detection; Deep Reinforcement Learning; Multi-Objective Optimization; Spårning genom detektion; Djup förstärkningsinlärning; Multiobjektiv optimering;

    Sammanfattning : Detecting generic objects is one important sensing task for applications that need to understand the environment, for example eXtended Reality (XR), drone navigation etc. However, Object Detection algorithms are particularly computationally heavy for real-time video analysis on resource-constrained mobile devices. LÄS MER

  4. 3. A Solution for Better Time Tracking

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

    Författare :Yash Dhanore; Vidhu Aggrawal; [2023]
    Nyckelord :Time reporting; Working hours; Slack bot; chatbot; Time tracking; Tidsrapportering; Arbetstider; Slack bot; chat-bot; Tidsuppföljning;

    Sammanfattning : Accurately tracking employee work hours is a vital aspect of managing any organization, regardless of its size. Time reporting serves as a valuable source of information for management teams, enabling them to effectively plan and manage projects, allocate resources, monitor budgets, and track overall productivity. LÄS MER

  5. 4. Computation Offloading for Real-Time Applications : Server Time Reservation for Periodic Tasks

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

    Författare :Lizzy Tengana Hurtado; [2023]
    Nyckelord :Computation Offloading; Real-Time Applications; Resource Reservation; Beräkningsavlastning; realtidsapplikationer; resursreservation;

    Sammanfattning : Edge computing is a distributed computing paradigm where computing resources are located physically closer to the data source compared to the traditional cloud computing paradigm. Edge computing enables computation offloading from resource-constrained devices to more powerful servers in the edge and cloud. LÄS MER

  7. 5. Rust async for thread-per-core packet processing

    Master-uppsats, Linköpings universitet/Institutionen för datavetenskap

    Författare :Josef Olsson; Isak Stenström; [2023]
    Nyckelord :;

    Sammanfattning : When building a packet processing system, it is common to use frameworks that are written in C and built upon DPDK Eventdev, which is what Ericsson AB currently uses. However, using Rust async for this task could improve the developer experience and efficiency. LÄS MER