Dynamic scheduling on parallel machines (Q1331960): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Algorithms for Scheduling Tasks on Unrelated Processors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal online scheduling of parallel jobs with dependencies / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4385522 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computational models for parallel computers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank | |||
Normal rank | |||
Latest revision as of 17:31, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic scheduling on parallel machines |
scientific article |
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
