A system contains

$1$

$6$

$$computing nodes located in different

buildings. Each node has a stored text file. It is required to find the two files

with nearest size. Describe an algorithm to solve this problem and find the

cost as function of:

$($

State your assumptions

$)$

Ni : Size of file

$($

i

$)$

n i : Number of code lines run in node

$($

i

$)$

C i

$,$

j : connection cost between node i and node j

t i

$,$

j : connection delay

between node i and node j

write a mpi code