1. Method of representing in a single data structure data-amount-weighted location of data needed by single software subroutine or single task running in a distributed memory multi-processor computer, accessing both local and remote memory, comprising: (a) representation of physical data location in form of one or more distributed memory architecture dependant coordinates of processing nodes being able to access said physical data location in shorter time than any other processing node in idle system conditions; (b) representation of data amount; (c) method to combine two or more different said weighted representations of data location structures into one by producing either a fractional mean data amount-weighted coordinate representation of physical location and total amount of data or list of a limited number of items listing largest amounts of needed data together with corresponding representations of physical location; whereby said structure serves as distributed memory architecture independent means to determine one or more processing nodes best suited to perform calculations on plurality of local and remote memory data items combined into said structure and to be processed by means of a single computational task.