Divide-and-Conquer for Parallel Processing

1 June 1983

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers

Vol. C-32 (6) , 582-585
https://doi.org/10.1109/tc.1983.1676280

Abstract

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.)

Keywords

This publication has 8 references indexed in Scilit:

IN-SITU MACHINING AND REPAIR OF CAMERON FC STYLE XMAS TREES
Published by Society of Petroleum Engineers (SPE) ,1989
MP/C: A Multiprocessor/Computer Architecture
IEEE Transactions on Computers, 1982
Simulation experiments of a tree organized multicomputer
Published by Association for Computing Machinery (ACM) ,1979
Distributed processes
Communications of the ACM, 1978
Communicating sequential processes
Communications of the ACM, 1978
Modula: A language for modular multiprogramming
Software: Practice and Experience, 1977
Parallel Processing with the Perfect Shuffle
IEEE Transactions on Computers, 1971
Quicksort
The Computer Journal, 1962