Distributed And Parallel Computing

in presenting most types of topologies in a coherent and organized manner. Chapter 2 describes the models of computation, which are revisited in the other chapters. They include shared-memory machines, which the author calls PRAMS (parallel random access machine), and different models of interconnection networks. Most other chapters present methods of solution to different computational problems and data structures, together with analyses of their performance. The scope of methods treated in the book ranges from sorting algorithms to computation of the FFT vast Fourier Transform). The authors choose algorithms that work well pedagogically, and