Name
Abstract | ||
|---|---|---|
Consider a scheduling problem in which a set of tasks needs to be scheduled on m parallel processors. Each task \(T_i\) consists of a set of jobs with interjob communication demands, represented by a weighted, undirected graph \(G_i\). The processors are assumed to be interconnected by a shared communication channel, which can be used by jobs to communicate among each other while being processed in parallel. In each time step, the scheduler assigns jobs to the processors and allows any processed job to use a certain capacity of the channel in order to satisfy (parts of) its communication demands to adjacent jobs processed in the same step. The goal is to find a schedule with minimum length in which the communication demands of all jobs are satisfied. We show that this problem is NP-hard in the strong sense even if the number of processors is constant and the underlying graph is a single path or a forest with arbitrary constant maximum degree. Consequently, we design and analyze approximation algorithms with asymptotic approximation ratio \(\min \{1.8, 1.5 \frac{m}{m-1}\}+1\) if the underlying graph G, the union of the \(G_i\), is a forest. For general graphs it is \(\min \left\{ 1.8, \frac{1.5m}{m-1}\right\} \cdot \left( \text {arb}(G) + \frac{5}{3}\right) \), where \(\text {arb}(G)\) denotes the arboricity of G. |
Year | Venue | Keywords |
|---|---|---|
2018 | COCOA | Scheduling, NP hardness, Approximation algorithms, Shared resource, Bin packing |
DocType | Volume | Issue |
Journal | 36 | 4 |
Citations | PageRank | References |
1 | 0.37 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jürgen König | 1 | 1 | 0.37 |
| Alexander Macker | 2 | 6 | 3.20 |
| Friedhelm Meyer auf der Heide | 3 | 1744 | 238.01 |
| Sören Riechers | 4 | 15 | 5.12 |