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

In some important application areas of hard real-time systems, preemptivesporadic tasks with harmonic periods and constraint deadlines running upon auni-processor platform play an important role. We propose a new algorithm fordetermining the exact worst-case response time for a task that has a lowercomputational complexity (linear in the number of tasks) than the knownalgorithm developed for the same system class. We also allow the taskexecutions to start delayed due to release jitter if they are within certainvalue ranges. For checking if these constraints are met we define a constraintprogramming problem that has a special structure and can be solved withheuristic components in a time that is linear in the task number. If the checkdetermines the admissibility of the jitter values, the linear time algorithmcan be used to determine the worst-case response time also for jitter-awaresystems.

Exact Polynomial Time Algorithm for the Response Time Analysis of Harmonic Tasks with Constrained Release Jitter