Parallelizability of Some P-Complete Problems

Abstract. In this paper, we consider parallelizability of some Pcomplete 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.

• Type: Conference
• Year: 2000
• Where: IPPS
• Authors: Akihiro Fujiwara, Michiko Inoue, Toshimitsu Masuzawa
• Keywords: Cost Optimal Parallel, Distributed And Parallel Computing, IPPS 2000, Optimal Parallel Algorithms, first Maximal