Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time (Q3777447): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:41, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time |
scientific article |
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
