An EDF schedulability test for periodic tasks on reconfigurable hardware devices

Danne, Klaus; Platzner, Marco

doi:10.1145/1134650.1134665

Cited by 24 publications

(28 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Work on scheduling and placement can be divided into off-line and online methods targeting both homogeneous or heterogeneous reconfigurable resources. Danne and Platzner [5] consider offline scheduling of periodic real-time tasks and adapted the global EDF scheduling approach to homogeneous reconfigurable hardware. Two preemptive scheduling algorithms, EDFFirst-k-Fit and EDF-Next-Fit, are presented.…”

Section: A Related Workmentioning

confidence: 99%

“…Furthermore they considered putting an currently unplaceble task on hold and continue with the next task in the queue until the device allocation changes. Danne [5] called this the EDF-NF (Next-Fit) algorithm and gave a schedulability test for periodic task sets. With the Next-Fit strategy the tasks can be placed and executed out-of-order, thus allowing the reconfigurable hardware to be better utilized.…”

Section: B Temporal Planingmentioning

confidence: 99%

“…Therefore, a strong nexus between the temporal planning and placement of tasks exists. Most works in the area of scheduling and placement for RHDs consider only static module selection, meaning that the module to be placed on the RHD is known at compile time [1], [3], [4], [5], [6].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Integrated Temporal Planning, Module Selection and Placement of Tasks for Dynamic Networks-on-Chip

Mahr

Christgau

Haubelt

et al. 2011

2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PHD Forum

View full text Add to dashboard Cite

In this work dynamic module selection is integrated in a scheduling and placement flow of tasks for a Dynamic Network-on-Chip. Several implementations (modules) of a task are considered, which differ in size and execution time. In contrast, most state-of-the-art flows consider one module per task, therefore having a static module selection during compile time. Tasks arrive and need to be scheduled and placed by finding a feasible start time and place, such that they meet their deadlines and area requirements. Tasks that do not meet these requirements are rejected. Heuristics for module selection are presented and integrated in an O(n log n) scheduling and placement flow using EDF-Next-Fit. Evaluation of the dynamic module selection heuristics is performed using synthetic benchmarks. The results show a lower rejection rate of tasks when compared to static module selection.

show abstract

Section: A Related Workmentioning

confidence: 99%

Section: B Temporal Planingmentioning

confidence: 99%

See 1 more Smart Citation

Integrated Temporal Planning, Module Selection and Placement of Tasks for Dynamic Networks-on-Chip

Mahr

Christgau

Haubelt

et al. 2011

2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PHD Forum

View full text Add to dashboard Cite

show abstract

“…Danne and Platzner presented one of the developed works for scheduling real-time hardware tasks on FPGAs by using EDF [16]. However, although they considered the overheads introduced by the device's reconfiguration mechanism, they completely ignored the sequential access exclusiveness of ICAP.…”

Section: A Related Workmentioning

confidence: 99%

“…We measured the performance of ATB in relation to both (1) Danne and Platzner's EDF based approach (exclusively timebased scheduling) [16] and (2) exclusively area-based GAF scheduling. In order to address the ICAP access exclusiveness, the EDF policy was applied to the allocation deadlines as proposed by Dittmann in [17].…”

Section: Algorithm 1 Area-time Balancing Scheduling (Atb)mentioning

confidence: 99%

ATB: Area-Time response Balancing algorithm for scheduling real-time hardware tasks

Iturbe

Benkrid

Arslan

et al. 2010

2010 International Conference on Field-Programmable Technology

View full text Add to dashboard Cite

This paper describes a novel scheduling algorithm for the execution of hardware tasks with real-time constraints onto partially and dynamically reconfigurable FPGAs. The AreaTime response Balancing scheduling algorithm (ATB) is inspired by the well-known Earliest Deadline First (EDF) algorithm, which is extended with a technique for reducing the fragmentation on FPGA's reconfigurable area. This technique promotes the reuse of the resources that are released when great area tasks finish their execution by smaller area tasks as long as the real-time constraints permit to do so. Providing an exclusively time-based algorithm, such as EDF, with support for dealing with area-related issues ensures the best results. Simulation results reported in this paper show that ATB misses 23% less deadlines than EDF. Moreover, since FPGA's damaged resources provoke unpredictable fragmentation on the device, ATB is currently the best scheduling option to be used in a Reliable Reconfigurable Real-Time Operating System (R3TOS).

show abstract

Exact Schedulability Analysis for Static-Priority Global Multiprocessor Scheduling Using Model-Checking

Guan

Deng

et al. 2007

Software Technologies for Embedded and Ubiquitous Systems

View full text Add to dashboard Cite

To determine schedulability of priority-driven periodic tasksets on multi-processor systems, it is necessary to rely on utilization bound tests that are safe but pessimistic, since there is no known method for exact schedulability analysis for multi-processor systems analogous to the response time analysis algorithm for single-processor systems. In this paper, we use model-checking to provide a technique for exact multiprocessor scheduability analysis by modeling the real-time multi-tasking system with Timed Automata (TA), and transforming the schedulability analysis problem into the reachability checking problem of the TA model.

show abstract

An EDF schedulability test for periodic tasks on reconfigurable hardware devices

Cited by 24 publications

References 25 publications

Integrated Temporal Planning, Module Selection and Placement of Tasks for Dynamic Networks-on-Chip

Integrated Temporal Planning, Module Selection and Placement of Tasks for Dynamic Networks-on-Chip

ATB: Area-Time response Balancing algorithm for scheduling real-time hardware tasks

Exact Schedulability Analysis for Static-Priority Global Multiprocessor Scheduling Using Model-Checking

Contact Info

Product

Resources

About