Application-defined scheduling in Ada | Zendy

Mario Aldea Rivas | Zendy; Michael González Harbour | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Application-defined scheduling in Ada

Author(s) -

Mario Aldea Rivas,

Michael González Harbour

Publication year - 2003

Publication title -

acm sigada ada letters

Language(s) - English

Resource type - Conference proceedings

eISSN - 1557-9476

pISSN - 1094-3641

DOI - 10.1145/959222.959231

Subject(s) - computer science , dynamic priority scheduling , scheduling (production processes) , earliest deadline first scheduling , fixed priority pre emptive scheduling , distributed computing , processor scheduling , fair share scheduling , two level scheduling , rate monotonic scheduling , deadline monotonic scheduling , embedded system , real time computing , operating system , resource (disambiguation) , computer network , engineering , operations management , schedule

This paper is a proposal for an application program interface (API) that would enable Ada applications to use application-defined scheduling algorithms in a way compatible with the scheduling model of the Ada 95 Real-Time Systems Annex. With this API, several application-defined schedulers, implemented by extending a tagged type, can coexist in the system in a predictable way together with their scheduled tasks, and with regular fixed priority tasks directly scheduled by the run-time system. Task synchronization through protected objects is also considered by adding the Stack Resource Policy, which can be used in a large variety of fixed and dynamic priority scheduling policies.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research