Parallelizability of some P-complete problems
In this paper, we consider parallelizability of some P-complete problems. First we propose a parameter which indicates parallelizability for a convex layers problem. We prove P-completeness of the problem and propose a cost optimal parallel algorithm, according to the parameter. Second we consider a lexicographically first maximal 3 sums problem. We prove P-completeness of the problem by reducing a lexicographically first maximal independent set problem, and propose two cost optimal parallel algorithms for related problems. The above results show that some P-complete problems have efficient cost optimal parallel algorithms.
KeywordsConvex Hull Parallel Algorithm Adjacent Vertex Input Graph Sequential Algorithm
Unable to display preview. Download preview PDF.
- 3.W. Chen. Parallel Algorithm and Data Structures for Geometric Problems. PhD thesis, Osaka University, 1993.Google Scholar
- 5.A. Dessmark, A. Lingas, and A. Maheshwari. Multi-list ranking: complexity and applications. In 10th Annual Symposium on Theoretical Aspects of Computer Science (LNCS665), pages 306–316, 1993.Google Scholar
- 6.J. Erickson and R. Seidel. Better lower bounds on detecting affine and spherical degeneracies. In 34th Annual IEEE Symposium on Foundations of Computer Science (FOCS’ 93), pages 528–536, 1993.Google Scholar
- 7.A. Fujiwara, M. Inoue, and M. Toshimitsu. Practical parallelizability of some P-complete problems. Technical Report of IPSF, Vol. 99, No. 72 (AL-69-2), September 1999.Google Scholar
- 9.R. Greenlaw, H.J. Hoover, and W.L. Ruzzo. Limits to Parallel Computation: P-Completeness Theory. Oxford university press, 1995.Google Scholar