Write e program that generates two N by N matrixes A and B and computes C, the result of the multiplication of A by B. The computation has to be performed by M threads, each working on a partition of C. Check the correctness of the result against result computed sequentially. Plot scalability curve for the program.

• use

  int atoi(char *)

  to convert the command line arguments to integers

• use the

  std::chrono

  library to get time before and after the parallel computation and to compute the elapsed time:

  std::chrono::time_point<std::chrono::system_clock> start, end;
  start = std::chrono::system_clock::now();
  ...
  end = std::chrono::system_clock::now();
  std::chrono::duration<double> elapsed_seconds = end-start;

• use plain

  rand

  to generate random numbers in the two matrixes