A Work-Optimal Algorithm on log delta n Processors for a P-Complete Problem
Abstract
We present a parallel algorithm for the Lexicographically First Maximal Independent Set Problem on graphs with bounded degree 3 that is work-optimal on a shared memory machine with up to $\log ^\delta n$ processors, for any $0 < \delta < 1$. Since this problem is P-complete it follows (assuming $\mathcalNC \not \mathcalP$) that the algorithmics of coarse grained parallel machines and of fine grained parallel machines differ substantially.
Domains
Other [cs.OH]
Loading...