<p>I am trying to solve a preemptive multi-core scheduling problem, where the input is the tasks. The number of cores <code>M</code> can be decided after seeing the input tasks. I need to output the minimal <code>M</code> such that the run time is as long as the maximal task length.</p>
<p>I feel this is related to bin packing with fragmentation, but fragmentation does not require linear constraints.</p>
<p>I doubt I am the first to study this problem but have been unable to find a name for this problem. Does it have a name?</p>

CC BY-SA 4.0
2021-08-12T15:47:42.703Z
The name of this kind of problems is "work-stealing scheduling". You can find thousands of papers on Google using this keyword
Lamine
CC BY-SA 4.0
2021-08-12T16:53:33.353Z
That has dynamically spawns threads for a fixed number of cores. In my problem, the cores is the unknown.
Blue Granny
<partition-problem><scheduling><packing>
Bin Packing And Preemptive Multi-Core Scheduling
Blue Granny
# Bin Packing And Preemptive Multi-Core Scheduling

(Asked by: username_0 on 2021-08-12)

I am trying to solve a preemptive multi-core scheduling problem, where the input is the tasks. The number of cores `M` can be decided after seeing the input tasks. I need to output the minimal `M` such that the run time is as long as the maximal task length.

I feel this is related to bin packing with fragmentation, but fragmentation does not require linear constraints.

I doubt I am the first to study this problem but have been unable to find a name for this problem. Does it have a name?

**Tags:** partition-problem, scheduling, packing
> **Comments:**
> **username_1**: The name of this kind of problems is "work-stealing scheduling". You can find thousands of papers on Google using this keyword  
> **username_0**: That has dynamically spawns threads for a fixed number of cores. In my problem, the cores is the unknown.  

---

## 0 answers

