Skip to main content

Presentation of the control graph models

  • Conference paper
  • First Online:
Operating Systems (OS 1974)

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

Included in the following conference series:

  • 2312 Accesses

Abstract

Figure 4 shows an example of modelling of a time-sharing system at a crude level where two functions: the processing and the roll-in or roll-out routines have been expanded into subgraphs.

In his models the author has chosen to put the emphasis on the parallelism of tasks, the synchronization of processes and the influence of resource sharing and his graphical representation was designed to express these features in the most convenient way.

The description presented in this article was intended to show the main difficulties of an actual implementation of the simulator on a computer system and anyone whishing to go into the details of the formalization should refer to [13] or [14].

Although this model was developped with the idea of a computer implemented simulator, the author has shown (see [13], [15], [16], [17]) that the Control Graph Models are also very useful as analytical tools for the evaluation of systems. In particular synchronization problems and resource deadlocks can be probed and some performance evaluation can be obtained quite easily in some cases.

It is hoped that further research will extend these capabilities so that new and better designed systems will be produced because their Control Graph Models were carefully constructed and thoroughly analysed and understood.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. Aslanian R. and Benett M., “Computer Assisted Operating System Design using evolutive Modelling”, Third Symposium on Operating Systems Principles, Oct. 1971.

    Google Scholar 

  2. Bradshaw F.T. “Structure and Representation of Digital Computer Systems”, Ph. D. thesis, Case Western Reserve University, Cleveland, Ohio, Jan. 1971.

    Google Scholar 

  3. Coffman E.G., “Stochastic Models of Multiple and Time shared Computer Operations”, Ph. D. thesis, UCLA, Los Angeles, California, June 1966.

    Google Scholar 

  4. Dennis J.B. and Van Horn E.C., “Programming Semantics for Multi-programmed Computations”, Comm. of ACM vol 9, nℴ3, March 1966.

    Google Scholar 

  5. Dijkstra E.W., “Co-operating Sequential Processes”, Programming Languages F. Genuys Ed., New-York, Academic 1968.

    Google Scholar 

  6. Dijkstra E.W., “Structure of the “THE” Multiprogramming System”, Comm. of ACM, Vol. 11, nℴ5, May 1968.

    Google Scholar 

  7. Glaser E.L., “Introduction and Overview of the Logos Project”, CWRU, Cleveland Ohio, Report, Oct. 1971.

    Google Scholar 

  8. Grangeon P.L., “The Design and Implementation of a Multi-Level File System”, Ph. D. thesis, CWRU, Cleveland, Ohio, Jan. 1974.

    Google Scholar 

  9. Hamlet R.G., “Efficient Multiprogramming Resource Allocation and Accounting”, Comm. of ACM, Vol. 16, Nℴ6, June 1973.

    Google Scholar 

  10. Holt R.C., “On Deadlocks in Computer Systems”, Ph. D. thesis, University of Toronto, Canada, Jan. 1971.

    Google Scholar 

  11. Karp R.M. and Miller R.E., “Parallel Program Schemata”, Journal of Computer and Systems Sciences Nℴ3, 1969.

    Google Scholar 

  12. Martin D.F. and Estrin G., “Models of Computation and Systems: Evaluation of the Vertex Probabilities”, Journal of ACM, Vol. 14, nℴ2, April 1967.

    Google Scholar 

  13. Parent M.R., “The control Graph Models: a Unified Approach to Performance Evaluation”, Ph. D. thesis, CWRU, Cleveland, Ohio, March 1974.

    Google Scholar 

  14. Parent M.R., “Formalization of the Control Graph Models”, CWRU, Cleveland, Ohio, Report, March 1974.

    Google Scholar 

  15. Parent M.R., “Relevance and Consistence of Control Graph Models”, CWRU, Cleveland Ohio, Report, March 1974.

    Google Scholar 

  16. Parent M.R., “Stochastic Analysis of Control Graph Models”, CWRU, Cleveland, Ohio, Report, March 1974.

    Google Scholar 

  17. Parent M.R., “An Introduction to the Study of Permanent Blockings”, CWRU, Cleveland, Ohio, Report, March 1974.

    Google Scholar 

  18. Petri C.A., “Communication with Automata”, Translation, Suppl. 1 to Tech. Report RAD C-TR-65-337, Vol. 1, Griffiss Air Force Base, New-York, N.Y., 1966.

    Google Scholar 

  19. Ricart J., “Process Structure and Synchronization in CHI-OS Operating System”, CWRU, Cleveland, Ohio, Report, June 1973.

    Google Scholar 

  20. De Rivet P.H., “Data Traffic Models for the Performance of Modular Computer Systems”, Ph.D. thesis, CWRU, Cleveland, Ohio, June 1971.

    Google Scholar 

  21. Rose C.W., “A System of Representation for General Purpose Digital Computer System”, Ph.D. thesis, CWRU, Cleveland, Ohio, Sept. 1970.

    Google Scholar 

  22. Slutz D.R., “The Flow Graph Schemata Model of Parallel Computation”, Ph.D. Thesis, MIT, Cambridge, Mass., Sept. 1968.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

E. Gelenbe C. Kaiser

Rights and permissions

Reprints and permissions

Copyright information

© 1974 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Parent, M. (1974). Presentation of the control graph models. In: Gelenbe, E., Kaiser, C. (eds) Operating Systems. OS 1974. Lecture Notes in Computer Science, vol 16. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029365

Download citation

  • DOI: https://doi.org/10.1007/BFb0029365

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06849-5

  • Online ISBN: 978-3-540-37805-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics