Skip to main content

Adaptive Scheduling using Reflection

  • Conference paper
  • First Online:
  • 331 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1357))

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 metagroups 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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5 References

  1. T. Watanabe and A. Yonezawa, “Reflection in an Object-Oriented Concurrent Language,” ACM SIGPLAN Notices-Proceedings of OOPSLA’88, 23(11), pp. 306–315, 1988.

    Article  Google Scholar 

  2. P. Maes, “Concepts and Experiments in Computational Reflection,” ACM SIGPLAN Notices-Proceedings of OOPSLA’87, 22(12), pp. 147–155, 1987.

    Article  Google Scholar 

  3. S. E. Mitchell, “TAO-A Model for the Integration of Concurrency and Synchronisation in Object-Oriented Programming,” Department of Computer Science, University of York, UK, 1995

    Google Scholar 

  4. S. E. Mitchell and A. J. Wellings, “Synchronisation, Concurrent Object-Oriented Programming and the Inheritance Anomaly,” Computer Languages, 22(1), pp. 15–26, 1996.

    Article  Google Scholar 

  5. C. D. Locke, “Best-Effort Decision Making for Real-Time Scheduling,” Computer Science Department, CMU, 1986

    Google Scholar 

  6. L. Sha, A. R. Rajkumar, and A. J. P. Lehoczky, “Priority Inheritance Protocols: An Approach to Real-Time Synchronisation,” IEEE Transactions on Computers, 39(9), pp. 1175–1185, 1990.

    Article  MathSciNet  Google Scholar 

  7. H. Masuhara, S. Matsuoka, T. Watanabe, and A. Yonezawa, “Object-Oriented Concurrent Reflective Languages can be Implemented Efficiently,” ACM SIGPLAN Notices — Proceedings of OOPSLA’92, 27(11), pp. 127–144, 1992.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mitchell, S.E., Burns, A., Wellings, A.J. (1998). Adaptive Scheduling using Reflection. In: Bosch, J., Mitchell, S. (eds) Object-Oriented Technologys. ECOOP 1997. Lecture Notes in Computer Science, vol 1357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69687-3_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-69687-3_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64039-4

  • Online ISBN: 978-3-540-69687-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics