Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms (Q5197703): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:52, 8 February 2024
scientific article; zbMATH DE number 7107161
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms |
scientific article; zbMATH DE number 7107161 |
Statements
Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms (English)
0 references
19 September 2019
0 references
concurrent data structures
0 references
maximal independent set
0 references
relaxed data structures
0 references
task scheduling
0 references
