updated hw4

git-svn-id: svn://anubis/gvsu@238 45c1a28c-8058-47b2-ae61-ca45b979098e
This commit is contained in:
josh 2008-11-22 04:02:09 +00:00
parent a68186b5c8
commit 22a26b6e03

View File

@ -35,10 +35,13 @@
\vskip 1em
\item[2.]{
Assume that $p \leq n$ and if any process $i$ owns more than one row of
the matrix, then the rows that it owns are contiguous.
Then, for each process $p$, a gather operation is
performed.
We are to transpose an $n \times n$ matrix that is initially
rowwise block-decomposed among $p$ processes.
Assume that $p \leq n$ and if any process $i$ owns $k > 1$ rows of
the matrix, then the $k$ rows that it owns are contiguous.
Then, the procedure to transpose the matrix is as follows:
For each process $i$, a gather operation is performed.
}