The problem of organizing parallel processes is quite intriguing. Virtually all aspects of IT require parallel processing of information and computer architectures supporting parallelism for enhancing performance of a particular IT solution. At the same time, it has been proven that the development an algorithm of a computer program involving parallel computing and execution on an architecture supporting parallel computing is considered to be an NP-complete problem. This means that this problem doesn't have a practical solution.

Despite the complexities involved in this issue, we would dare to say that we have a solution that would allow implementing the natural parallelism pertaining to virtually all algorithms. Moreover, the solution would allow the code to be executed effectively on a parallel architecture. In addition to that, we believe that it is possible to organize execution of hundred percent parallel programs (of course, this will involve some inefficiency). This new method is by no means a magic or trickery. It's a revolutionary new method for organizing algorithms and computing.

You are welcome to initiate a discussion after going over the articles offered on this web site. The material contains information about the particularities of the method mentioned above and its experimental real-world implementations. You can gain access to more detailed descriptions of the method after you contact the author. Your feedback will be greatly appreciated.