SPEEDING UP THE GENERATION OF NEAR-RINGS ON FINITE CYCLIC GROUPS USING PARALLEL PROCESSING IN C

摘要

The main purpose of this article is to reduce the generation time of near-rings on finite cyclic groups using the parallel processing provided by C#. We divide the near-rings into independent subsets and generate them simultaneously. The calculations are further accelerated after refactoring and defining appropriate compiler optimizations.