\subsection{\bf Issues for Parallel Computing}

\begin{slide}
\begin{itemize}
\item i) If $N_{\rm proc}$ does not exactly divide $n+1$, then
one (or more) processors have less work than the others---minor load
imbalance and slightly tedious programming.

\item ii) Adaptive algorithms (e.g., Romberg) could lead to
load imbalance if one introduces new integration points selectively
(so that one gets more integration points in one processor than another).

\centerline{\psfig{figure=ni.fig4.ps,clip=true,width=5.5in}}

\vspace{15pt}

\item Parallel random numbers were discussed in statistics module.
\end{itemize}
\end{slide}

