Adaptive Scheduling Using Reflection

Authors:
Stuart E. Mitchell;Alan Burns;Andy J. Wellings
Affiliations:
-;-;-
Venue:
ECOOP '97 Proceedings of the Workshops on Object-Oriented Technology
Year:
1997

Citing 6
Cited 0

Concepts and experiments in computational reflection

OOPSLA '87 Conference proceedings on Object-oriented programming systems, languages and applications
Reflection in an object-oriented concurrent language

OOPSLA '88 Conference proceedings on Object-oriented programming systems, languages and applications
Object-oriented concurrent reflective languages can be implemented efficiently

OOPSLA '92 conference proceedings on Object-oriented programming systems, languages, and applications
Priority Inheritance Protocols: An Approach to Real-Time Synchronization

IEEE Transactions on Computers
Best-effort decision-making for real-time scheduling

Best-effort decision-making for real-time scheduling
Synchronisation, concurrent object-oriented programming and the inheritance anomaly

Computer Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a model for adaptable scheduling for hard and soft real-time systems that are designed to cope with a variety of situations including unexpected faults, imprecisely defined environments, reconfiguration etc. The model uses scheduling groups (derived from meta-groups as used in ABCL/R) that are responsible for managing shared resources within a set of components. Each group has an independent schedule (for simultaneous soft and hard groups) and many factors can be modified at run-time.