The Community for Technology Leaders
Green Image
Issue No. 06 - June (1983 vol. 32)
ISSN: 0018-9340
pp: 582-585
E. Horowitz , Department of Computer Science, University of Southern California
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.)
time and data movement complexity, Divide-and-conquer, parallel architectures, parallel matrix multiplication, parallel sorting

A. Zorat and E. Horowitz, "Divide-and-Conquer for Parallel Processing," in IEEE Transactions on Computers, vol. 32, no. , pp. 582-585, 1983.
90 ms
(Ver 3.3 (11022016))