CRITICAL PATH SCHEDULING PARALLEL PROGRAMS ON AN UNBOUNDED NUMBER OF PROCESSORS (Q5291296): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:19, 8 February 2024
scientific article; zbMATH DE number 5022347
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | CRITICAL PATH SCHEDULING PARALLEL PROGRAMS ON AN UNBOUNDED NUMBER OF PROCESSORS |
scientific article; zbMATH DE number 5022347 |
Statements
CRITICAL PATH SCHEDULING PARALLEL PROGRAMS ON AN UNBOUNDED NUMBER OF PROCESSORS (English)
0 references
10 May 2006
0 references
scheduling
0 references
clustering
0 references
distributed computing
0 references
precedence task graphs
0 references
directed acyclic graphs
0 references
DAGs
0 references
parallel scheduling
0 references
