Parallel Algorithms for Relational Coarsest Partition Problems

Loading...
Thumbnail Image
Penn collection
Technical Reports (CIS)
General Robotics, Automation, Sensing and Perception Laboratory
Degree type
Discipline
Subject
GRASP
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Lee, Insup
Contributor
Abstract

Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPS are Ρ-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(n1+∈) time using m/n∈ CREW PRAAM processors, for any fixed ∈ < 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.

Advisor
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
1993-08-05
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-93-71.
Recommended citation
Collection