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

Algorithms based on semi-partitioned scheduling have been proposed as aviable alternative between the two extreme ones based on global and partitionedscheduling. In particular, allowing migration to occur only for few tasks whichcannot be assigned to any individual processor, while most tasks are assignedto specific processors, considerably reduces the runtime overhead compared toglobal scheduling on the one hand, and improve both the schedulability and thesystem utilization factor compared to partitioned scheduling on the other hand.In this paper, we address the preemptive scheduling problem of hard real-timesystems composed of sporadic constrained-deadline tasks upon identicalmultiprocessor platforms. We propose a new algorithm and a scheduling paradigmbased on the concept of semi-partitioned scheduling with restricted migrationsin which jobs are not allowed to migrate, but two subsequent jobs of a task canbe assigned to different processors by following a periodic strategy.

Semi-Partitioned Hard Real-Time Scheduling with Restricted Migrations upon Identical Multiprocessor Platforms