English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

This paper considers the scheduling of parallel real-time tasks witharbitrary-deadlines. Each job of a parallel task is described as a directedacyclic graph (DAG). In contrast to prior work in this area, wheredecomposition-based scheduling algorithms are proposed based on theDAG-structure and inter-task interference is analyzed as self-suspendingbehavior, this paper generalizes the federated scheduling approach. We proposea reservation-based algorithm, called reservation-based federated scheduling,that dominates federated scheduling. We provide general constraints for thedesign of such systems and prove that reservation-based federated schedulinghas a constant speedup factor with respect to any optimal DAG task scheduler.Furthermore, the presented algorithm can be used in conjunction with anyscheduler and scheduling analysis suitable for ordinary arbitrary-deadlinesporadic task sets, i.e., without parallelism.

Reservation-Based Federated Scheduling for Parallel Real-Time Tasks