Lower bounds on parallel algorithms for finding the first maximal independent set (Q1072703): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(86)90145-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1965151869 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallelism in Comparison Problems / rank | |||
Normal rank | |||
Latest revision as of 12:17, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds on parallel algorithms for finding the first maximal independent set |
scientific article |
Statements
Lower bounds on parallel algorithms for finding the first maximal independent set (English)
0 references
1986
0 references
In this paper we introduce a model of computation using oracles which allows us to consider a class of problems which involve selecting a subset of a set of elements. This class can be solved in linear sequential time, but we prove that any deterministic or probabilistic parallel algorithm using p processors can achieve a speedup of at most O(log p). In addition, we prove that any algorithm that solves this class of problems must have a specific sequential structure.
0 references
independence system
0 references
parallel computation
0 references
oracles
0 references
