Advances in Parallel Computing, Volume 1JAI Press, 1990 - Parallel processing (Electronic computers) |
Contents
PARALLEL COMPUTATION | 39 |
PERTURBATION OF FIXEDPOINT ITERATIVE METHODS | 81 |
PROBLEMS THAT ARE UNLIKELY TO HAVE EFFICIENT | 123 |
Copyright | |
7 other sections not shown
Common terms and phrases
A₁ a₂ allocation analysis application architecture asteroids asynchronous iterations band matrices calculations channel circuit value problem column communication complexity convergence cooperating processors corresponding cycle detector array diagonals efficiency elements equations example execution FLOP function given hardware hypercube IEEE Trans input interconnection linear algebra LINPACK log-space complete log-space-complete problems loop LU decomposition machine matrix band method MFLOP Miellou multiprocessor n₂ NBANDL nodes number of cooperating number of processors operations optical implementation optical processor optimal orbits outer product output overhead parallel algorithms Parallel Computing parallel processing performance planets precedence graph Proc programming model r₁ resource Section sequence sequential algorithm shared memory shift register shown in Figure solution solved Spaceguard sparsity speed of computations static step subroutines subtasks systolic algorithms systolic array Table task Theorem tion topology transducer transformation triangular unilateral-meetings scheme variables vector vector processors vertices y₁