# Scheduling with interjob communication on parallel processors

- 45 Downloads

## 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*.

## Keywords

Scheduling NP hardness Approximation algorithms Shared resource Bin packing## Notes

### Acknowledgements

Funding was provided by Deutsche Forschungsgemeinschaft (Grant No. CRC 901).

## References

- Althaus E, Brinkmann A, Kling P, Meyer auf der Heide F, Nagel L, Riechers S, Sgall J, Süß T (2016) Scheduling shared continuous resources on many-cores. J Sched 21(1):77–92MathSciNetCrossRefGoogle Scholar
- Brinkmann A, Kling P, Meyer auf der Heide F, Nagel L, Riechers S, Süß T (2014) Scheduling shared continuous resources on many-cores. In: Proceedings of the 26th ACM symposium on parallelism in algorithms and architectures (SPAA ’14). ACM, pp 128–137Google Scholar
- Chung F, Graham R, Mao J, Varghese G (2006) Parallelism versus memory allocation in pipelined router forwarding engines. Theory Comput Syst 39(6):829–849MathSciNetCrossRefGoogle Scholar
- Collaborative Research Centre 901. On-the-fly-computing. http://sfb901.uni-paderborn.de
- de la Vega WF, Lueker GS (1981) Bin packing can be solved within 1+epsilon in linear time. Combinatorica 1(4):349–355MathSciNetCrossRefGoogle Scholar
- Dósa G, Li R, Han X, Tuza Z (2013) Tight absolute bound for First Fit Decreasing bin-packing: FFD(L) \(\le \) 11/9 OPT(L) + 6/9. Theor Comput Sci 510:13–61MathSciNetCrossRefGoogle Scholar
- Epstein L, Levin A, van Stee R (2012) Approximation schemes for packing splittable items with cardinality constraints. Algorithmica 62(1–2):102–129MathSciNetCrossRefGoogle Scholar
- Epstein L, Van Stee R (2007) Approximation schemes for packing splittable items with cardinality constraints. In: Proceedings of the 5th international workshop on approximation and online algorithms (WAOA ’05), volume 4927 of LNCS. Springer, pp 232–245Google Scholar
- Epstein L, van Stee R (2011) Improved results for a memory allocation problem. Theory Comput Syst 48(1):79–92MathSciNetCrossRefGoogle Scholar
- Gabow HN, Westermann HH (1992) Forests, frames, and games: algorithms for matroid sums and applications. Algorithmica 7(5&6):465–497MathSciNetCrossRefGoogle Scholar
- Happe M, Meyer auf der Heide F, Kling P, Platzner M, Plessl C (2013) On-the-fly computing: a novel paradigm for individualized IT services. In: Proceedings of the 16th IEEE international symposium on object/component/service-oriented real-time distributed computing (ISORC ’13). IEEE Computer Society, pp 1–10Google Scholar
- Karmarkar N, Karp RM (1982) An efficient approximation scheme for the one-dimensional bin-packing problem. In: Proceedings of the 23rd annual symposium on foundations of computer science (FOCS ’82). IEEE Computer Society, pp 312–320Google Scholar
- Király T, Lau LC (2011) Degree bounded forest covering. In Proceedings of the 15th international conference on integer programming and combinatorial optimization (IPCO ’11), pp 315–323CrossRefGoogle Scholar
- van Rooij JMM, van Kooten Niekerk ME, Bodlaender HL (2013) Partition into triangles on bounded degree graphs. Theory Comput Syst 52(4):687–718MathSciNetCrossRefGoogle Scholar