Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms (Q5197703): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2886779068 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1808.04155 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:37, 19 April 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
