Parallel & Distributed Algorithms: Proceedings of the International Workshop on Parallel & Distributed Algorithms, Chateau de Bonas, Gers, France, 3-6 October, 1988Michel Cosnard Recent research into algorithms and parallelization methods is presented in this book, together with an overview of current developments. An unusual feature of the project is the exchange of ideas between researchers working in the field of parallel processing and researchers working in distributed systems, an idea from which both communities benefit. |
Common terms and phrases
architecture block bound Branch and Bound broadcast cache called cell channels column communication complexity Computer Science Cosnard cycle defined dependency graph diagonal DISTRIBUTED ALGORITHMS distributed systems domain efficient eigenvalues elements equations event example execution factorisation Figure FORTRAN function Gaussian elimination global grid hypercube IKARUS implementation input integer iteration Lanczos Lanczos algorithm latency Leiserson level 3 BLAS linear algebra logical clocks loop machine mapping matrix Megaflops method multiplication multiprocessor node number of processors obtained operations optimal page-ahead parallel algorithms PARALLEL AND DISTRIBUTED Parallel Computing parameters partitioning path algebra path problems performance phase pipelined Proc protocol Publishers B. V. North-Holland reorthogonalization requires routines scheduling Science Publishers B. V. sequence sequential simulation solution solve sparse sparse matrix speed-up step structure subroutines supercomputers synchronous systolic array task techniques Theorem total algorithms transformations updating variables VLSI