Patent ID: 7626983

Claim:
A method of creating a tile-switch mapping architecture comprising: multiplying a data communication flow from an arbitrary first tile k to an arbitrary second tile l by a hop distance value between arbitrary first and second switches i and j, in which the hop distance value of the first and second switches i and j is changed to the hop distance values of switches abutting the first tile k and switches abutting the second tile l, the multiplication is carried out for the changed hop distance values: summing the data communication flow multiplication results; multiplying a communication volume from an arbitrary first core s to an arbitrary second core d by the summation of the data communication flow multiplication results, when the first core s is mapped to the first tile k and the second core d is mapped to the second tile l, in which proximity index values of the first and second tiles k and l are changed to the proximity index values of all tiles, the multiplication is carried out for the changed proximity index values; summing the communication volume multiplication results; carrying out the summation of the communication volume multiplication results calculations for all cores; and summing the calculations for all cores results, to thereby determine which of the first and second tiles k and l minimize the hop distance between the first and second switches i and j.