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

The growing need for continuous processing capabilities has led to thedevelopment of multicore systems with a complex cache hierarchy. Such multicoresystems are generally designed for improving the performance in average case,while hard real-time systems must consider worst-case scenarios. An openchallenge is therefore to efficiently schedule hard real-time tasks on amulticore architecture. In this work, we propose a mathematical formulation forcomputing a static scheduling that minimize L1 data cache misses between hardreal-time tasks on a multicore architecture using communication affinities.

Cache-aware static scheduling for hard real-time multicore systems based on communication affinities