Towards an Architecture-Independent Analysis of Parallel Algorithms
01 January 1990
Harnessing the massively parallel architectures soon to become available into efficient algorithmic cooperation is one of the most important intellectual challenges facing Computer Science today. To the theoretician, the task seems similar to that of understanding the issues involved in the performance of sequential algorithms (which motivated Knuth's books, among other important works), only infinitely more complex.