The models of computation realized in modern computers and corresponding types of computer architecture are shortly considered, including the model of computation with parallel ordered access to the data and instructions. The statement that the identification of components of a computer system and a computer program, as well as data items is the basis of the computational model implemented in the computer is justified. The problem of expansion and classification of methods for the computer tool components identification, as well as the problem of analysis and development of methods for combining the models of computation through the sharing of methods inherent to different models are formulated. The list of actions to be performed in order to set the algorithm's step-by-step procedure in the computer program is provided, and it is proved that the identifiers of computer components are used to organize their execution. The functions of the identifiers of computer components are described and their types are defined. The classification features by which the identifiers of the computer facilities are distinguished, and on their basis their classification was made by their dividing into the following types: constant or variables; individual or group; single or plural. The principles of identification of the computer facilities components by the named types of identifiers are developed and examples of uses and combination of the models of computation with different types of the computer facilities components identifiers are given.
- Https://en.wikipedia.org/wiki/Turing_machine.
- Burks, Arthur W., Herman H. Goldstine, and John von Neumann. Preliminary Discussion of the Logical Design of an Electronic Computing Instrument. [Princeton: Institute for Advanced Studies, September 1947.]
- Batcher, K., Staran Parallel Processor System Hardware, Proc. National Computer Cont. AFIPS., 1974, pp. 405–410.
- Stormon, C. e. a., A General-purpose CMOS Associative Processor IC and System. IEEE Micro, Vol. 12, No. 6, Dec, 1992, pp. 68–78.
- Potter, J., Associative Computing – A Programming Paradigm for Massively Parallel Computers, N.Y.: Plenum Publishing, 1992.
- Schoeberl, M., Design and Implementation of an Efficient Stack Machine, In: In Proceedings of the 12th IEEE Reconfigurable Architecture Workshop, RAW 2005, Denver, Colorado, USA, April, 2005.
- Koopman, P. J., Stack computers: the new wave, Halsted Press, 1989.
- Agervala, T. and Arvind, Data Flow Systems, Computer, Vol. 15, No. 2, Feb, 1982, pp. 10–13.
- Gajski, D. D., Padua, D. A., Kuck, D. J., and Kuhn, R., A Second Opinion on Data Flow Machines and Languages, Computer, Vol. 15, No. 2, Feb, 1982, pp. 58–69.
- Gurd, J. andWatson, I., A Practical Data Flow Computer, Computer, Vol. 15, No. 2, Feb, 1982, pp. 51–57.
- Melnyk A.O. Computer Memory with Parallel Conflict-Free Sorting Network-Based Ordered Data Access. Recent Patents on Computer Science, 2015, Volume 8(1), pp. 67–77.
- Melnyk A. Parallel ordered-access machine computational model and architecture / Anatoliy Melnyk // Advances in Cyber-Physical Systems. – 2016. – Volume 1, number 2. – P. 93–101.
- Melnyk A. Ordered access memory and its application in parallel processors architecture / Anatoliy Melnyk / Advances in Cyber-Physical Systems. – 2017. – Volume 2, number 2. – P. 54–62.
- Stallings, W., Computer Organization and Architecture, Pearson, 10th ed., 2016. Melnyk A. Computer Architecture. Scientific publication. – Lutsk: Volyn Regional Publishing House, 2008. – 470 p.