An algebraic model for divide-and-conquer and its parallelism
- 1 November 1988
- journal article
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 2 (3) , 257-278
- https://doi.org/10.1007/bf00129780
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Applications of a strategy for designing divide-and-conquer algorithmsScience of Computer Programming, 1987
- A Partitioning Strategy for Nonuniform Problems on MultiprocessorsIEEE Transactions on Computers, 1987
- A taxonomy of problems with fast parallel algorithmsInformation and Control, 1985
- The cube-connected cycles: a versatile network for parallel computationCommunications of the ACM, 1981
- Universal schemes for parallel communicationPublished by Association for Computing Machinery (ACM) ,1981
- Parallel Prefix ComputationJournal of the ACM, 1980
- Parallel Processing with the Perfect ShuffleIEEE Transactions on Computers, 1971