Online makespan minimization for MapReduce scheduling on multiple parallel machines
In this work, we investigate the online MapReduce processing problem on mm uniform parallel machines, aiming at minimizing the makespan. Each job consists of two sets of tasks, namely, the map tasks and the reduce tasks. A job’s map tasks can be arbitrarily split and processed on different machines...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2024-11-01
|
| Series: | Demonstratio Mathematica |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/dema-2024-0040 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|