Concept and synthesis of an operating system nucleus implemented in computer hardware

ABSTRACT

In this paper a concept of an operating system nucleus is introduced and its synthesis is discussed. According to this concept the operating system nucleus should be realized as hardware that generates the operation code and address parts of the programs belonging to the OS-nucleus. Note that in the current OS-nucleus the same opcode appearing in different instructions is stored very many memory locations. In the presented solution each opcode appearing in very many instructions is represented by only one elementary memory element (e.g. by one flip-flop), included in the designed hardware. Similar reasoning concerns the addresses of operands. In this paper the synthesis of such type of the hardware by using graphs is considered and also its result in the form of the block diagram of this hardware is shown. Moreover, some advantages of the presented approach to new type of the OS-nucleus are discussed.

REFERENCES

• 1: Edward G. Coffman, Jr. , Peter J. Denning, Operating Systems Theory, Prentice Hall Professional Technical Reference, 1973
• 2: Dei%el H.M., An Introduction to Operating Systems, Addison-Wesley, London 1984.
• 3: Kazimierczak J., Automaton with Internal Parameter, Report 58/83, iCT, Technical University of Wreclaw 1983.
• 4: Kazimierczak J., Introduction to Synthesis of the Self-Organizing Operating System Nucleus, ECAI-84 - Proceedings of the Sixth European Conference on Artificial Intelligence, North-Holland 1984.
• 5: Gerald J. Popek , Charles S. Kline, Issues in Kernel Design, Operating Systems, An Advanced Course, p.209-227, January 1978
• 6: Alan C. Shaw, The Logical Design of Operating Systems, Prentice Hall PTR, Upper Saddle River, NJ, 1974
• 7: Jaques Tiberghien, New Computer Architectures, Academic Press, Inc., Orlando, FL, 1984

INDEX TERMS

Primary Classification:
  D. Software
  D.4 OPERATING SYSTEMS

Additional Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.1 Models of Computation
          Subjects: Automata (e.g., finite, push-down, resource-bounded)

  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS

General Terms:
Design, Measurement, Performance, Theory