HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

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

Jens Gustedt 1 Jan Arne Telle
1 RESEDAS - Software Tools for Telecommunications and Distributed Systems
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Document type :
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 9:59:21 AM
Last modification on : Friday, February 4, 2022 - 3:30:09 AM
Long-term archiving on: : Sunday, April 4, 2010 - 8:54:44 PM


  • HAL Id : inria-00072448, version 1



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⟩



Record views


Files downloads