Complexity of parallel partitioned algorithms
A general concept for the description of partitioned algorithms is presented. It is based on a partitioning of the occurring data in datablocks of equal size. For a class of partitioned algorithms including matrix multiplication, LU-decomposition of a matrix, solving a linear system of equations it is proved: using a fixed number p of processing elements (PEs) the time complexity of a parallel partitioned algorithm is minimal if either all p PEs or if only one PE is used for executing one operation on datablocks.
KeywordsExecution Time Parallel Algorithm Minimum Span Tree Systolic Array Sequential Algorithm
Unable to display preview. Download preview PDF.
- Bitton, D., DeWitt, D.J., Hsaio, D.K., Menon, J., A taxonomy of parallel sorting, ACM Comp. Surv. 16,3, 287–318 (1984)Google Scholar
- Fortune,S., Wyllie,J., Parallelism in random access machines, Proc. of the 10th ACM STOC, 114–118 (1978)Google Scholar
- Hwang, K., Cheng, Y.-H., Partitioned matrix algorithms for VLSI arithmetic systems, IEEE Trans. Comp. C-31,12, 1215–1224 (1982)Google Scholar
- Moldovan, D.I., Fortes, J.A.B., Partitioning and mapping algorithms into fixed size systolic arrays, IEEE Trans. Comp. C-35,1, 1–12 (1986)Google Scholar