CONSTRUCTIVE MODEL OF ADAPTATION OF DATA STRUCTURES IN RAM. PART II. CONSTRUCTORS OF SCENARIOS AND ADAPTATION PROCESSES
DOI:
https://doi.org/10.15802/stp2016/67302Keywords:
data structure, constructive and productive structure, adaptation, designer, converterAbstract
Purpose.The second part of the paper completes presentation of constructive and the productive structures (CPS), modeling adaptation of data structures in memory (RAM). The purpose of the second part in the research is to develop a model of process of adaptation data in a RAM functioning in different hardware and software environments and scenarios of data processing. Methodology. The methodology of mathematical and algorithmic constructionism was applied. In this part of the paper, changes were developed the constructors of scenarios and adaptation processes based on a generalized CPS through its transformational conversions. Constructors are interpreted, specialized CPS. Were highlighted the terminal alphabets of the constructor scenarios in the form of data processing algorithms and the constructor of adaptation – in the form of algorithmic components of the adaptation process. The methodology involves the development of substitution rules that determine the output process of the relevant structures. Findings. In the second part of the paper, system is represented by CPS modeling adaptation data placement in the RAM, namely, constructors of scenarios and of adaptation processes. The result of the implementation of constructor of scenarios is a set of data processing operations in the form of text in the language of programming C#, constructor of the adaptation processes – a process of adaptation, and the result the process of adaptation – the adapted binary code of processing data structures. Originality. For the first time proposed the constructive model of data processing – the scenario that takes into account the order and number of calls to the various elements of data structures and adaptation of data structures to the different hardware and software environments. At the same the placement of data in RAM and processing algorithms are adapted. Constructionism application in modeling allows to link data models and algorithms for their processing with the performance criteria in the framework of unified approach and applied means. The developed models allow us to study the process of adaptation and control it. Practical value. The developed model and methods allow automatically changing the data placement in the RAM and their algorithmic connection depending on the operational requirements, the design features of the hardware and software operating environment.
References
Akulovskiy V.G. Algebra dlya opisaniya dannykh v kompozitsionnykh skhemakh algoritmov [Algebra to describe the data in the compositional schemes of algorithms]. Problemy prohramuvannia – Programming Problems, 2012, no. 2-3, pp. 234-240.
Akulovskiy V.G. Osnovy algebry algoritmov, baziruyushcheysya na dannykh [Basic algebra algorithms based on data]. Problemy prohramuvannia – Programming Problems, 2010, no. 2-3, pp. 89-96.
Andon F.I., Doroshenko A.Ye., Tseytlin G.Ye., Yatsenko Ye.A. Algebro-algoritmicheskiye modeli i metody parallelnogo programmirovaniya [Algorithmic algebraic models and methods of parallel programming]. Kyiv, Akademperyodyka Publ., 2007. 634 p.
Glushkov V.M., Tseytlin G.Ye., Yushchenko Ye.L. Algebra. Yazyki. Programmirovaniye [Algebra. Languages. Programming]. Kyiv, Naukova dumka Publ., 1978. 319 p.
Agafonov V. Dannyye v yazykakh programmirovaniya: abstraktsiya i tipologiya [Data in programming languages: abstraction and typology]. Moscow, Mir Publ., 1982. 328 p.
Doroshenko A.Ye., Akulovskiy V.G. Algebra algoritmov s dannymi i prognozirovaniye vychislitelnogo protsessa [Algebra of algorithms with data and prediction of computational process]. Problemy prohramuvannia – Programming Problems, 2011, no. 3, pp. 3-10.
Drozhdin V.V., Volodin V.M. Analiz effektivnosti i evolyutsiya struktur dannykh [Analysis of the effectiveness and evolution of data structures]. Sbornik statey IX Mezhdunarodnoy nauchno-tekhnicheskoy konferentsii «Problemy informatiki v obrazovanii, upravlenii, ekonomike i tekhnike» [Proc. of IX Intern. Sci. and Techn. Conf. «Problems of Informatics in education, management, economics and technology»]. Penza, 2009, pp. 33-44.
Yefimushkina N.V., Yefremov M.M., Orlov S.P. Issledovaniye podsistemy «kesh-pamyat-operativnaya pamyat» mnogoprotsessornykh vychislitelnykh system [The study of subsystem «cache-memory-RAM» multiprocessor computational systems]. Vestnik Samarskogo gosudarstvennogo tekhnicheskogo universiteta. Seriya: Tekhnicheskiye nauki [Bulletin of Samara State Technical University. Series: Technical Science], 2012, no. 3 (35), pp. 49-55.
Lavrishcheva Ye.M. Software Engineering kompyuternykh sistem. Paradigmy, tekhnologii i CASE-sredstva programmirovaniya [Software Engineering of computer systems. Paradigms, technologies and CASE tools of programming]. Kyiv, Naukova dumka Publ., 2013. 283 p.
Shynkarenko V.I., Zabula H.V. Konstruktivnaya model adaptatsii struktur dannykh v operativnoy pamyati. Chast I. Konstruirovaniye tekstov programm [Constructive model of data structures adaptation in RAM. Part I. Program text constructing]. Nauka ta prohres transportu – Science and Transport Progress, 2016, no. 1 (61), pp. 100–112. doi: 10.15802/stp2016/61003.
Shinkarenko V.I., Zabula G.V. Povysheniye vremennoy effektivnosti struktur dannykh v operativnoy pamyati na osnove adaptatsii [Improving time efficiency of data structures in memory-based adaptation]. Problemy prohramuvannia – Programming Problems, 2012, no. 2-3, pp. 211-218.
Shinkarenko V.I., Zabula G.V. Primeneniye geneticheskogo algoritma v zadachakh adaptatsii struktur dannykh [Application of genetic algorithm in problems of adaptation of data structures]. Iskusstvennyy intellect – Artificial Intelligence, 2012, no. 3, pp. 323-331.
Ren J., Pan W., Zheng Y., Shi Z., Yan X. Array Based HV/VH Tree: an Effective Data Structure for Layout Representation. Journal of Zhejiang University-SCIENCE C, 2012, vol. 13, issue 3, pp. 232-237. doi: 10.1631/jzus.c1100193.
Attali D., Lieutier A., Salinas D. Efficient Data Structure for Representing and Simplifying Simplicial Complexes in High Dimensions. Intern. Journal of Computational Geometry & Applications, 2012, vol. 22, issue 4, pp. 279-303. doi: 10.1142/S0218195912600060.
Bastani F.B., Iyengar S.S. The effect of data structures on the logical complexity of programs. Communication of the ACM, 1987, vol. 30, issue 3, pp. 250-259. doi: 10.1145/214748.214760.
Shynkarenko V.I., Ilman V.M. Constructive-Synthesizing Structures and Their Grammatical Interpretations. I. Generalized Formal Constructive-Synthesizing Structure. Cybernetics and Systems Analysis, 2014, vol. 50, issue 5, pp. 655-662. doi: 10.1007/s10559-014-9655-z.
Weiss M.A. Data Structures and Algorithm Analysis in C++. London, Pearson Education Inc. Publ., 2014. 656 p.
Downloads
Published
How to Cite
Issue
Section
License
Copyright and Licensing
This journal provides open access to all of its content.
As such, copyright for articles published in this journal is retained by the authors, under the terms of the Creative Commons Attribution 4.0 International License (CC BY 4.0). The CC BY license permits commercial and non-commercial reuse. Such access is associated with increased readership and increased citation of an author's work. For more information on this approach, see the Public Knowledge Project, the Directory of Open Access Journals, or the Budapest Open Access Initiative.
The CC BY 4.0 license allows users to copy, distribute and adapt the work in any way, provided that they properly point to the author. Therefore, the editorial board of the journal does not prevent from placing published materials in third-party repositories. In order to protect manuscripts from misappropriation by unscrupulous authors, reference should be made to the original version of the work.
