Accession Number : ADA288283
Title : Parallel Algorithms for Relational Coarsest ; Partition Problems.
Descriptive Note : Technical rept.,
Corporate Author : PENNSYLVANIA UNIV PHILADELPHIA DEPT OF COMPUTER AND INFORMATION SCIENCE
Personal Author(s) : Rajasekaran, Sanguthevar ; Lee, Insup
PDF Url : ADA288283
Report Date : 05 AUG 1993
Pagination or Media Count : 23
Abstract : Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPS are P-complete and hence it may not be possible to design polylog time parallel algorithms for these problems. In this paper, we present two efficient parallel algorithms for RCPP, in which its associated label transition system is assumed to have m transitions and n states. The first algorithm runs in O(n(exp 1+E)) time using m/n(exp E) CREW PRAM processors, for any fixed E< 1. This algorithm is analogous and optimal with respect to the sequential algorithm of Kanellakis and Smolka. the second algorithm runs in O(n log n) time using m/n log n CREW PRAM processor. This algorithm is analogous and nearly optimal with respect to the sequential algorithm of Paige and Tarjan.
Descriptors : *ALGORITHMS, *PARALLEL PROCESSING, DATA PROCESSING, COMPUTATIONS, COMPUTER PROGRAMMING, INPUT OUTPUT PROCESSING, PARALLEL PROCESSORS, CONCURRENT ENGINEERING, PROBLEM SOLVING, READ WRITE MEMORIES, RANDOM ACCESS COMPUTER STORAGE, SEQUENTIAL ANALYSIS.
Subject Categories : Computer Programming and Software
Distribution Statement : APPROVED FOR PUBLIC RELEASE