An Optimal Preemptive Algorithm for Online MapReduce Scheduling on Two Parallel Machines (Q4565266): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An optimal algorithm for preemptive on-line scheduling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Online MapReduce scheduling problem of minimizing the makespan / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3031924 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Online makespan minimization in MapReduce-like systems with complex reduce tasks / rank | |||
Normal rank | |||
Revision as of 20:11, 15 July 2024
scientific article; zbMATH DE number 6882636
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Optimal Preemptive Algorithm for Online MapReduce Scheduling on Two Parallel Machines |
scientific article; zbMATH DE number 6882636 |
Statements
An Optimal Preemptive Algorithm for Online MapReduce Scheduling on Two Parallel Machines (English)
0 references
11 June 2018
0 references
MapReduce
0 references
online algorithm
0 references
competitive ratio
0 references
makespan
0 references
