Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"gEDF"”.

  1. Global EDF Scheduling for Parallel Real-Time Tasks

    … we consider the Global Earliest Deadline First (GEDF) scheduling policy for task sets consisting of parallel tasks. Each task can be represented by a directed acyclic graph (DAG) where nodes represent computational work and edges represent dependences between nodes. In this model, we prove that …

    wustl Repository record for Global EDF Scheduling for Parallel Real-Time Tasks (opens in a new tab)

  2. Group-EDF: A New Approach and an Efficient Non-Preemptive Algorithm for Soft Real-Time Systems

    … conditions. Our approach, known as group-EDF (gEDF), is based on dynamic grouping of tasks with deadlines that are very close to each other, and using a shortest job first (SJF) technique to schedule tasks within the group. I believe that grouping tasks dynamically with similar deadlines and …

    unt Repository record for Group-EDF: A New Approach and an Efficient Non-Preemptive Algorithm for Soft Real-Time Systems (opens in a new tab)

  3. Energy-Aware Real-Time Scheduling on Heterogeneous and Homogeneous Platforms in the Era of Parallel Computing

    … into a common platform. We propose an algorithm GEDF-VD for scheduling MC tasks with internal parallelism in a multiprocessor platform. We also prove the correctness of GEDF-VD, provide a detailed quantitative evaluation, and reported extensive experimental results. Finally, we present an …

    ucf Repository record for Energy-Aware Real-Time Scheduling on Heterogeneous and Homogeneous Platforms in the Era of Parallel Computing (opens in a new tab)