Dynamic scheduling on parallel machines (Q1331960)
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: Dynamic scheduling on parallel machines |
scientific article; zbMATH DE number 626303
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic scheduling on parallel machines |
scientific article; zbMATH DE number 626303 |
Statements
Dynamic scheduling on parallel machines (English)
0 references
12 June 1995
0 references
The authors consider on-line job-scheduling on parallel machines with different network topologies. An on-line scheduling algorithm schedules a collection of parallel jobs with known resource requirements but unknown running times on a parallel machine. Algorithms are considered those that matches upper and lower bounds for scheduling on a two-dimensional mesh.
0 references
scheduling
0 references
parallel machines
0 references
network topologies
0 references
