A Heuristic Approach to Deal with the Scheduling Problem in the MO2 Distributed Model

  • Boudjema Mecibah
  • Ammar Attoui
Conference paper


MO2 is an object-oriented model which integrates in the same approach features of DBMS and features of real-time systems. It allows the definition of different kinds of relationships between objects: generalisation / specialisation, aggregation, asssociation. But its principal feature is the ability to distinguish passive objects and active objects. The passive objects react only through the activation of their methods. The active objects can have their own behaviour and can evolve under the sollicitation of various events independently of the activation of their methods. The implementation of the MO2 model on a distributed environnement must take into account the scheduling problem of all types of objects. The crux of our work is to schedule the periodic and aperiodic objects in a dynamic and flexible manner. Our solution is based on a heuristic algorithm.


Schedule Problem Schedule Algorithm Object Class Active Object Passive Object 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    K. R. ABBOTT, H.GARCIA-MOLINA. “Scheduling Real-time Transactions: a Performance Evaluation”, ACM Transactions on Database Systems, Vol 17, No. 3, September 1992, pages 513–560.CrossRefGoogle Scholar
  2. [2]
    M. ALABAU, T. DECHAIZE. “Ordonnancement Temps-Réel par échéance”, Technique et Science Informatique. Vol 11 -No3/1992, pages 59 it 123.Google Scholar
  3. 131.
    A. ATTOUI, M. SCHNEIDER. “An Object Oriented Model for Parallel and Reactive System”, IEEE Real-Time Systems Symposium, San Antonio, Texas, Dec 1991.Google Scholar
  4. [4]
    A. ATTOUI, M. SCHNEIDER. “502: A Flexible Object-Oriented Management System”, 2nd Internationl Conference on Reliability and Robustness of Engineering Software (RIES-91), Milan, 22–24 April 1991.Google Scholar
  5. [5]
    F. BRISSAUD. “Des Associations pour un Modèle ù Objets”, 4èmes Journées Pratiques et Outils Logiciels d’aide ù la conception de systèmes d’inlbrmation,Nantes, 25–27 September 1990.Google Scholar
  6. [6]
    R. HULL, R. KING. “Semantic Database Modeling: Survey, Applications and Research Issues”, ACM Computing Surveys, Vol. 10, n° 3, Sept. 1987.Google Scholar
  7. [7]
    P. KRUEGER, M. LIVNY. “The Diverse Objectives of Distributed Scheduling Policies”, Proc. IEEE Symposium on Distributed Computing Systems (1987), p. 242–249.Google Scholar
  8. [8]
    B. MECIBAH, A. ATTOUI. “Techniques dc Mises en Oeuvre d’un Ordonnanccur Temps-Réel pour le SGBD Orienté Objet et Temps-Réel MO2”, in the Eleventh IASTED International Conference May 19–21, 1993 Annecy FRANCEGoogle Scholar
  9. [9]
    B. MECIBAH, A. ATTOUI. “ Dealing with the scheduling problem in the MO2 distributed object-oriented real-time DBMS”, In the proceedings of the european simulation symposium 1993. October 25–28, 1993. DELFT, The Netherlands.Google Scholar
  10. [10]
    J K. RAMAMRITHAM, J. A. STANKOVIC, W. Zhao. “Distributed Scheduling of Tasks with Deadlines and Resource Requirements”, Ieee Transactions On Computers, Vol. 38, No. 8, August 1989.Google Scholar
  11. [11]
    R. G. SMITH. “The Contract Net Protocol: High-Level communication and control in a distributed problem solver,” Ieee Transactions on computers, Vol. C-29, N°. 12, Dec 1980.Google Scholar
  12. [12]
    J.A.STANKOVIC, “Evaluation of a Flexible Task Scheduling Algorithm for Distributed Hard Real-Time Systems”, Ieee Transactions on Computers, Vol. c-34, No. 12, December 1985.Google Scholar
  13. [13]
    P. KRUEGER, M. LIVNY. “The Diverse Objectives of Distributed Scheduling Policies”, Proc. Ieee Symposium on Distributed Computing Systems (1987), p. 242–249.Google Scholar
  14. [14]
    J.A.STANKOVIC “A Serious Problem for Next-Generation Systems”, Computer, October 1988.Google Scholar
  15. [15]
    W. ZHAO, K. RAMAMRITHAM, “Distributed Scheduling Using Bidding and Focused Addressing”, in Proc.Symp.Rcal-Time Syst., Dec 1985.Google Scholar

Copyright information

© Springer-Verlag/Wien 1994

Authors and Affiliations

  • Boudjema Mecibah
    • 1
  • Ammar Attoui
    • 1
  1. 1.Laboratoire d’informatiqueUniversité Clermont-Ferrand IIFrance

Personalised recommendations