Lower-bound complexity algorithm for task scheduling on heterogeneous grid (Q1700990)
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: Lower-bound complexity algorithm for task scheduling on heterogeneous grid |
scientific article; zbMATH DE number 6842058
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower-bound complexity algorithm for task scheduling on heterogeneous grid |
scientific article; zbMATH DE number 6842058 |
Statements
Lower-bound complexity algorithm for task scheduling on heterogeneous grid (English)
0 references
22 February 2018
0 references
task scheduling
0 references
grid computing
0 references
heterogeneous grids
0 references
0.7769663333892822
0 references
0.7545250058174133
0 references
0.7446454167366028
0 references
