Skip to content
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.

Commit db7fcf7

Browse files
committedNov 8, 2024
Address comments regarding 05-parallelism-practice
1 parent f6372e6 commit db7fcf7

File tree

1 file changed

+6
-4
lines changed

1 file changed

+6
-4
lines changed
 

‎05-parallelism-practice/05-parallelism-practice.tex

Lines changed: 6 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -109,14 +109,15 @@ \section{Tasks}
109109
\item Matrix Multiplication
110110
\item Systems of Linear Algebraic Equations
111111
\item Sort
112-
\item Computer Graphics
112+
\item Image Processing
113113
\end{itemize}
114114
\end{frame}
115115

116116
\begin{frame}{Disclaimers}
117117
\begin{itemize}
118118
\item All matrices should be stored in linear arrays (not \texttt{std::vector<std::vector<int> >})
119119
\item Performance should be meauserd on big matrices/vectors
120+
\item Total execution time (per test) is more than 1 second
120121
\item Functionality should be preserved for wide range of processes count
121122
\end{itemize}
122123
\end{frame}
@@ -189,7 +190,8 @@ \section{Data Transfer Methods}
189190
\begin{itemize}
190191
\item Requirement: Put the task you have chosen in the description
191192
\item Reference implementation: original MPI function
192-
\item Tasks size should be big. Broadcast should send more that one element (vector).
193+
\item Tasks size should be big. Broadcast should send more that one element (vector)
194+
\item Consider using binary trees to distribute data across different processes
193195
\end{itemize}
194196
\end{frame}
195197

@@ -291,9 +293,9 @@ \section{Sort}
291293
\end{itemize}
292294
\end{frame}
293295

294-
\section{Computer Graphics}
296+
\section{Image Processing}
295297

296-
\begin{frame}{Computer Graphics}
298+
\begin{frame}{Image Processing}
297299
\begin{itemize}
298300
\item Image Smoothing
299301
\item Contrast Enhancement

0 commit comments

Comments
 (0)
Please sign in to comment.