Bounding the number of processors and checkpoints needed in time-minimal parallel reversal schedules (Q1884644): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s00607-004-0075-1 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00607-004-0075-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2026287624 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00607-004-0075-1 / rank | |||
Normal rank | |||
Latest revision as of 11:55, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounding the number of processors and checkpoints needed in time-minimal parallel reversal schedules |
scientific article |
Statements
Bounding the number of processors and checkpoints needed in time-minimal parallel reversal schedules (English)
0 references
5 November 2004
0 references
multi-processor machine
0 references
