Achieving optimal backlog in multi-processor cup games (Q5212854): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2964054046 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1904.02861 / rank | |||
Normal rank | |||
Latest revision as of 00:53, 20 April 2024
scientific article; zbMATH DE number 7160587
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Achieving optimal backlog in multi-processor cup games |
scientific article; zbMATH DE number 7160587 |
Statements
Achieving optimal backlog in multi-processor cup games (English)
0 references
30 January 2020
0 references
cup emptying
0 references
deamortization
0 references
discretized scheduling
0 references
parallelism
0 references
processor sharing
0 references
smoothed analysis
0 references
