CRITICAL PATH SCHEDULING PARALLEL PROGRAMS ON AN UNBOUNDED NUMBER OF PROCESSORS (Q5291296): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling Precedence Graphs in Systems with Interprocessor Communication Times / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: List scheduling with and without communication delays / rank | |||
Normal rank | |||
Latest revision as of 13:50, 24 June 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
