Divide-and-conquer for parallel processing
Journal Article
·
· IEEE Trans. Comput.; (United States)
The well known divide-and-conquer paradigm has proven to be useful for deriving efficient algorithms for many problems. Several researchers have pointed out its usefulness for parallel processing; however, the problem of analysing 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 analysed, taking into account all relevant parameters of the model (time, data movement and number of processors). 16 references.
- Research Organization:
- Univ. of Southern California, Los Angeles
- OSTI ID:
- 5294713
- Journal Information:
- IEEE Trans. Comput.; (United States), Journal Name: IEEE Trans. Comput.; (United States) Vol. 6; ISSN ITCOB
- Country of Publication:
- United States
- Language:
- English
Similar Records
Supporting divide-and-conquer algorithms for image processing
A case against a divide and conquer approach to the nonsymmetric eigenvalue problem
A case against a divide and conquer approach to the nonsymmetric eigenvalue problem
Journal Article
·
Sat Jan 31 23:00:00 EST 1987
· J. Parallel Distrib. Comput.; (United States)
·
OSTI ID:6984858
A case against a divide and conquer approach to the nonsymmetric eigenvalue problem
Technical Report
·
Sat Nov 30 23:00:00 EST 1991
·
OSTI ID:5926172
A case against a divide and conquer approach to the nonsymmetric eigenvalue problem
Technical Report
·
Sat Nov 30 23:00:00 EST 1991
·
OSTI ID:10108206