Communicating sequential processes
Communications of the ACM
Distributed processes: a concurrent programming concept
Communications of the ACM
Merging with parallel processors
Communications of the ACM
Fundamentals of Computer Alori
Fundamentals of Computer Alori
Structure of Computers and Computations
Structure of Computers and Computations
Simulation experiments of a tree organized multicomputer
ISCA '79 Proceedings of the 6th annual symposium on Computer architecture
Sorting on a mesh-connected parallel computer
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
A divide-and-conquer computer.
A divide-and-conquer computer.
Parallel Processing with the Perfect Shuffle
IEEE Transactions on Computers
MP/C: A Multiprocessor/Computer Architecture
IEEE Transactions on Computers
Using PVM for Distributed Logic Minimization in a Network of Computers
Proceedings of the 6th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Paper: Divide-and-Conquer and parallel graph reduction
Parallel Computing
| Hi-index | 14.98 |
The well known divide-and-conquer paradigm has proved to be useful for deriving efficient algorithms for many problems. Several researchers have pointed out its usefulness for parallel processing; however, the problem of analyzing such parallel algorithms in a realistic setting has been largely overlooked. In this paper a realistic model for divide-and-conquer based algorithms is postulated; the efficiency of some algorithms is then analyzed, taking into account all relevant parameters of the model (time, data movement and number of processors.)