A Work-Optimal Algorithm on log delta n Processors for a P-Complete Problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2001

A Work-Optimal Algorithm on log delta n Processors for a P-Complete Problem

Jan Arne Telle
  • Function : Author
  • PersonId : 889063

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]
Fichier principal
Vignette du fichier
RR-4174.pdf (154.18 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00072448 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00072448 , version 1

Cite

Jens Gustedt, Jan Arne Telle. A Work-Optimal Algorithm on log delta n Processors for a P-Complete Problem. [Research Report] RR-4174, INRIA. 2001, pp.9. ⟨inria-00072448⟩
66 View
304 Download

Share

Gmail Facebook Twitter LinkedIn More