Enabling deadline scheduling for Java real-time computing

We present a scheduling architecture that enables the implementation of deadline based scheduling policies. The architecture is used to give real time capabilities to a custom Java virtual machine. This framework retains a clear separation between generic kernel mechanisms and upper level scheduling classes. A pure earliest deadline first algorithm can be implemented, but enhanced policies such as D/sup over/ or Robust EDF are also supported. We present our architecture, its implementation in the ChorusOS microkernel and its use by the Java virtual machine.

[1]  Marco Spuri,et al.  Value vs. deadline scheduling in overload conditions , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

[2]  Kelvin Nilsen,et al.  Issues in the Design and Implementation of Real-Time Java , 1998 .

[3]  C. Lizzi Java real-time distributed processing over ATM networks with Chorus/OS , 1999, 1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467).

[4]  Adriano Valenzano,et al.  MAP and TOP communications , 1992 .

[5]  Dennis Shasha,et al.  D^over: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems , 1995, SIAM J. Comput..

[6]  Kelvin Nilsen,et al.  Issues in the Design and Implementation of Real-Time Java , 1998 .

[7]  Dennis Shasha,et al.  D/sup over/; an optimal on-line scheduling algorithm for overloaded real-time systems , 1992, [1992] Proceedings Real-Time Systems Symposium.