A tool for the static optimization of concurrent programs

A programming tool, called parallelizer, for the static optimization of concurrent programs is considered. The tool partitions the alternative command lists of a nondeterministic iterative command into distinct elements that are concurrently executed. To improve the program´s performance, the tool determines a decomposition where the granularity of the resulting processes is close to optimal for the target parallel architecture. This requires that some parameters of the target architecture are taken into account. Search techniques traditionally used in artificial intelligence are exploited to determine an optimal alternative assignment. The implementation of the parallelizer is described and an example of its application is considered