Parallel Algorithms for Relational Coarsest ; Partition Problems.

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 05, 1993
Accession Number
ADA288283

Entities

People

  • Insup Lee
  • Sanguthevar Rajasekaran

Organizations

  • University of Pennsylvania

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Classification
  • Compression
  • Computations
  • Computers
  • Information Science
  • Lepidoptera
  • Lists (Data Structures)
  • Mathematics
  • Military Research
  • Parallel Computing
  • Pennsylvania
  • Sequences
  • Simulations
  • Splitting
  • Transitions

Readers

  • Graph Algorithms and Convex Optimization.
  • Linear Algebra