Co-Scheduling Persistent Periodic and Dynamic Aperiodic Real-Time Tasks on Reconfigurable Platforms
Citations
[...]
435 citations
19 citations
Cites background or methods from "Co-Scheduling Persistent Periodic a..."
...2) in the case of multiple channels: a) the proposed strategies continue to exhibit similar behavior by achieving higher addition success rates than the other considered strategies (EHD, DMP, RTQS, DPSC_PR/DPSC_FR, and GlobalScheduler), and Combination always achieves the highest one....
[...]
...Note that this strategy uses RM for periodic messages scheduling while sending aperiodic ones in the available slack time; e) the average response time provided by the Combination strategy has decreased significantly after using two channels; then, it increased a bit as channels number increases, but still lower than what is provided by EDH, DPSC_PR/DPSC_FR, and GlobalScheduler, since these strategies are providing a long response time with alow message addition success rate, whereas Combination provides the highest message addition success rate with a short response time....
[...]
...With five channels, the message addition success rate achieved by Balance is around 70%, by Dilute around 40%, and by Combination around 85%; b) the message addition success rates achieved by the related strategies EDH, DMP, RTQS, DPSC_PR/DPSC_FR, and GlobalScheduler do not exceed 30%....
[...]
...6, where: 1) in case of one channel: a) the average energy consumption provided by DMP, Balance, Dilute, and Combination strategies are close to each other, whereas RTQS and GlobalScheduler provide the highest ones, and EDH and DPSC_PR/DPSC_FR provide the lowest one....
[...]
...4, where: 1) the messages addition success rate achieved by the proposed strategies Balance and Dilute is increased symmetrically, where it is 1% for both strategies with one channel, and 5% for Balance and 8% for Dilute with five channels; 2) the messages addition success rate achieved by the strat- egy DPSC_PR/DPSC_FR is increased symmetrically, where it goes up to 5% with one channel and around 24% with five channels; 3) the messages addition success rate achieved by the strat- egy GlobalScheduler is increased symmetrically, where it is around 6% with one channel, and around 24% with five channels....
[...]
10 citations
Cites background from "Co-Scheduling Persistent Periodic a..."
...Works exist which focus on task scheduling and execution on FPGAs without taking its vulnerability aspects into account [18]....
[...]
...Bitstreams with which the FPGA VPs are to be reconfigured at runtime are stored in the FPGA memory or resource pool [17], [18]....
[...]
6 citations
6 citations
References
910 citations
"Co-Scheduling Persistent Periodic a..." refers background in this paper
...The situation becomes worse as the number of processing elements in the system increases [17]....
[...]
[...]
435 citations
"Co-Scheduling Persistent Periodic a..." refers methods in this paper
...They proposed EDF-Next Fit (EDF-NF), a variant of the EDF [22] algorithm which uses the concept of master processes (servers) to reserve area and execution time for tasks....
[...]
...The newly arrived task is accepted if such a feasible EDF schedule is actually realizable....
[...]
...The admission controller then attempts to generate an Earliest Deadline First (EDF) schedule considering all tasks in L....
[...]
...We used a deadline partitioning based fair scheduling approach in order to schedule persistent periodic tasks and an EDF like strategy for scheduling aperiodic tasks on the spare computational resources left after the allocation of the periodic tasks....
[...]
...Andersson et al. [32] proposed necessary and sufficient feasibility conditions to achieve low overhead exact admission control in EDF scheduled systems consisting of either, only aperiodic tasks, or a combination of persistent periodic tasks and dynamic aperiodic tasks....
[...]
172 citations
"Co-Scheduling Persistent Periodic a..." refers methods in this paper
...DPCS-PR partitions the task set into m disjoint subsets using a strategy similar to DP-Wrap [7] as follows: the tasks are allocated (one tile at a time) in any order starting from...
[...]
...based proportional fair scheduling methodology [7] devel-...
[...]
...After checking the necessary condition in Equation (2), DPCS-PR partitions the task set into m disjoint subsets using a strategy similar to DP-Wrap [7] as follows: the tasks are allocated (one tile at a time) in any order starting from the first tile V1, such that the combined sum of task shares along with the reconfiguration overheads in each such tile is less than the time-slice interval tslr....
[...]
152 citations
"Co-Scheduling Persistent Periodic a..." refers methods in this paper
...discussed a similar approach called Slot-Shifting, in [28]....
[...]
127 citations