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

DOI10.1007/S10766-007-0061-2MaRDI QIDQ941829zbMATH OpenOpenAlexFDO

Authors Kiran Yellajyosula, K. Subramani

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

Loss of dispatchabilityPartially clairvoyant dispatcherReal-time schedulingSafety intervalShared-memory

Mathematics Subject Classification ID

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

Recommendations

• An analysis of partially Clairvoyant scheduling
• Partially clairvoyant scheduling for aggregate constraints
• Verification, Model Checking, and Abstract Interpretation
• An analysis of totally clairvoyant scheduling
• An empirical analysis of algorithms for partially Clairvoyant scheduling

Cites work

• An analysis of partially Clairvoyant scheduling
• scientific article; zbMATH DE number 53606 (Why is no real title available?)
• scientific article; zbMATH DE number 1196650 (Why is no real title available?)
• scientific article; zbMATH DE number 1947502 (Why is no real title available?)
• scientific article; zbMATH DE number 2080043 (Why is no real title available?)
• Parametric dispatching of hard real-time tasks
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Cited in

(2)

• A polynomial time algorithm for Zero-Clairvoyant scheduling
• Partially clairvoyant scheduling for aggregate constraints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q941829)