Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time (Q3777447)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time |
scientific article; zbMATH DE number 4039281
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time |
scientific article; zbMATH DE number 4039281 |
Statements
Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time (English)
0 references
1988
0 references
expander graphs
0 references
optimal speed-up
0 references
scheduling
0 references
approximate reschedulings
0 references
PRAM algorithm
0 references
list ranking
0 references
0.9205867
0 references
0.88775945
0 references
0.8862628
0 references
0.88263535
0 references
0.88120955
0 references
0.8780813
0 references
