A method for comparison of options for location of data in the memory of a multi-processor computing system

The paper is concerned with the problem of allocating the informational fields of algorithm statements among memory modules of associated processor elements (with the statement allocation fixed). A method is suggested for comparing options of data location by using a system of binary relations between data elements. The method allows for feasible options of exchange between memory modules in processor elements and to the upper and lower-bounds of the number of desired inter-processor exchanges.