A linear parallel algorithm to compute bisimulation and relational coarsest partitions

05/25/2021
by   Jan Martens, et al.
0

The most efficient way to calculate strong bisimilarity is by calculation the relational coarsest partition on a transition system. We provide the first linear time algorithm to calculate strong bisimulation using parallel random access machines (PRAMs). More precisely, with n states, m transitions and |𝐴𝑐𝑡|≤ m action labels, we provide an algorithm on max(n,m) processors that calculates strong bisimulation in time O(n+|𝐴𝑐𝑡|) and space O(n+m). The best-known PRAM algorithm has time complexity O(nlog n) on a smaller number of processors making it less suitable for massive parallel devices such as GPUs. An implementation on a GPU shows that the linear time-bound is achievable on contemporary hardware.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/09/2017

A linear-time algorithm for the maximum-area inscribed triangle in a convex polygon

Given the n vertices of a convex polygon in cyclic order, can the triang...
research
07/01/2020

A Typo in the Paterson-Wegman-de Champeaux algorithm

We investigate the Paterson-Wegman-de Champeaux linear-time unification ...
research
03/10/2020

Optimal-size problem kernels for d-Hitting Set in linear time and space

We improve two linear-time data reduction algorithms for the d-Hitting S...
research
01/30/2013

Logarithmic Time Parallel Bayesian Inference

I present a parallel algorithm for exact probabilistic inference in Baye...
research
06/02/2023

No-dimensional Tverberg Partitions Revisited

Given a set P ⊂^d of n points, with diameter , and a parameter ∈ (0,1), ...
research
12/25/2009

Genus Computing for 3D digital objects: algorithm and implementation

This paper deals with computing topological invariants such as connected...
research
06/11/2021

Bandwidth-Optimal Random Shuffling for GPUs

Linear-time algorithms that are traditionally used to shuffle data on CP...

Please sign up or login with your details

Forgot password? Click here to reset