No label defined (Q4815880)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2099400
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2099400 |
Statements
8 September 2004
0 references
static scheduling
0 references
multiprocessors
0 references
heuristics
0 references
0.8522829413414001
0 references
0.8147351741790771
0 references
0.7884888648986816
0 references
0.7875087261199951
0 references
A problem of benchmarking heuristics and metaheuristics algorithms for static scheduling of dependent tasks onto multiprocessor systems is considered. For communicating tasks with non negligible communication times, the official benchmarks are not adequate. Moreover, the case when processors constituting a multiprocessor system are not completely connected was not considered at all. In this paper the new set of benchmarks for a selected scheduling problem is given. It is also discussed how new benchmarks overcome the drawbacks of existing sets of test examples. For the entire collection see [Zbl 1031.90002].
0 references