On the design and implementation of a shared memory dispatcher for partially clairvoyant schedulers

DOI10.1007/s10766-007-0061-2zbMath1154.68348OpenAlexW2001589961MaRDI QIDQ941829

Kiran Yellajyosula, K. Subramani and Vahan Mkrtchyan

Publication date: 2 September 2008

Published in: International Journal of Parallel Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10766-007-0061-2

zbMATH Keywords

Real-time schedulingLoss of dispatchabilityPartially clairvoyant dispatcherSafety intervalShared-memory

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• An analysis of partially Clairvoyant scheduling
• Parametric dispatching of hard real-time tasks
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the design and implementation of a shared memory dispatcher for partially clairvoyant schedulers