ИСТИНА

Computers are developing quickly, and each new platform requires software developers to repeatedly analyze algorithms to answer the two eternal questions. Does an algorithm possess the necessary properties to meet the architectural requirements? How can an algorithm be transformed so that the necessary properties can be easily reflected in parallel programs? Is it possible to perform the analysis “once and for all,” describing properties of algorithms so that all of the necessary information can be gleaned from this description any time a new architecture appears? This raises a series of non-trivial questions. Moreover, our experience shows that creating a complete description of an algorithm is not a simply challenge, it is a large series of challenges. And nevertheless, this can be done. Changes in computer architecture do not change algorithms – this is the main principle that underlies the AlgoWiki project and that makes a proposed approach efficient and successful.