Designing Communication-Efficient Matrix Algorithms in Distributed-Memory Cilk

@inproceedings{Baruch2002DesigningCM,
  title={Designing Communication-Efficient Matrix Algorithms in Distributed-Memory Cilk},
  author={Eyal Baruch},
  year={2002}
}
This thesis studies the relationship between parallelism, space and communication in dense matrix algorithms. We study existing matrix multiplication algorithms, specifically those that are designed for shared-memory multiprocessor machines (SMP’s). These machines are rapidly becoming commodity in the computer industry, but exploiting their computing power… CONTINUE READING