Abstract

The main purpose of the article is to present a modern method of parallel-vertical data security, which, thanks to the counting of units in the i-th input bit slice and the parallel formation of the i-th bit slice of a sorted array of numbers, reduces the protection time. The object of the study is the personnel database of an engineering company. The research methodology involves the use of parallel sorting methods for the development of technical and technological means for ensuring the security of data arrays, methods for parallel search for maximum and minimum values for the development of hardware and software tools for searching for maximum and minimum values. The practical aspect of the obtained results lies in the development of technologies for parallel sorting and retrieval of data in real time with high efficiency in the use of equipment. A hardware structure is presented for simultaneous parallel-vertical search for maximum and minimum numbers to increase the speed of ensuring the security of personnel databases. The innovativeness of the results obtained lies in the schematic representation of the proposed approach to application. The diagrams themselves are the author's vision. The structure of a parallel-flow device for ensuring the security of a two-dimensional array of numbers using the displacement method is presented. In our opinion, such a technical-technological update will serve as an innovation in the context of the security of personnel databases of an engineering company.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.