Implementing a flexible scheduler in Ada

DOI10.1007/3-540-45136-6_14MaRDI QIDQ2771786zbMATH OpenFDO

Authors Guillem Bernat, Alan Burns

Publication date 18 February 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2043/20430179

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) General topics in the theory of software (68N01) Theory of programming languages (68N15) Computing methodologies and applications (68U99)

Recommendations

• A POSIX-Ada interface for application-defined scheduling
• A round robin scheduling policy for Ada
• Frameworks for adaptable scheduling algorithms
• Concurrent and Real-Time Programming in Ada 2005

Cited in

(3)

• Defining new non-preemptive dispatching and locking policies for Ada
• A POSIX-Ada interface for application-defined scheduling
• A round robin scheduling policy for Ada

This page was built for publication: Implementing a flexible scheduler in Ada

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