Abstract
The report considers solution to the problem of improving the speed implementation of the operation of multiplying two square matrices of the same dimension. To carry out calculations and comparative analysis of the speed of the multiplication operation, we consider a computer system (CS) in the positional binary number system (PNS) and in the non-positional number system in the residual classes (the residual number system - RNS). A comparative analysis of the performance of the CS was carried out with the same characteristics of the computing system: equal lengths of bit grids, the same command systems, the same methods of addressing operands and instructions, the same clock speed of the processor, the equal number of program commands, etc. When calculating the speed of the matrix multiplication operation, the fastest data processing method in RNS was used, based on the tabular principle.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
