Complexity results for throughput and latency optimization of replicated and data-parallel workflows (Q973005)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity results for throughput and latency optimization of replicated and data-parallel workflows |
scientific article; zbMATH DE number 5713394
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity results for throughput and latency optimization of replicated and data-parallel workflows |
scientific article; zbMATH DE number 5713394 |
Statements
Complexity results for throughput and latency optimization of replicated and data-parallel workflows (English)
0 references
28 May 2010
0 references
pipeline graphs
0 references
fork graphs
0 references
scheduling algorithms
0 references
throughput maximization
0 references
latency minimization
0 references
bi-criteria optimization
0 references
heterogeneous platforms
0 references
complexity results
0 references
0.7981122732162476
0 references
0.7740327715873718
0 references
0.7535338997840881
0 references
0.7526007890701294
0 references
0.7490886449813843
0 references
