The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - June (1983 vol.32)
pp: 582-585
E. Horowitz , Department of Computer Science, University of Southern California
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.)
INDEX TERMS
time and data movement complexity, Divide-and-conquer, parallel architectures, parallel matrix multiplication, parallel sorting
CITATION
E. Horowitz, A. Zorat, "Divide-and-Conquer for Parallel Processing", IEEE Transactions on Computers, vol.32, no. 6, pp. 582-585, June 1983, doi:10.1109/TC.1983.1676280
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool