Advertisement

Scheduling with Interjob Communication on Parallel Processors

  • Jürgen König
  • Alexander Mäcker
  • Friedhelm Meyer auf der Heide
  • Sören RiechersEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10043)

Abstract

Consider a scheduling problem in which a set of jobs with interjob communication, canonically represented by a weighted tree, needs to be scheduled on m parallel processors interconnected by a shared communication channel. In each time step, we may allow 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 parallel. The goal is to find a schedule with minimum length in which 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 and the maximum degree of the underlying tree is constant. Consequently, we design and analyze simple approximation algorithms with asymptotic approximation ratio Open image in new window in case of paths and a ratio of Open image in new window in case of arbitrary trees.

Keywords

Schedule Problem Capacity Constraint Dependency Graph Approximation Factor Parallel Processor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Collaborative Research Centre 901 - On-The-Fly-Computing. http://sfb901.uni-paderborn.de
  2. 2.
    Brinkmann, A., Kling, P., auf der Heide, F.M., Nagel, L., Riechers, S., Süß, T.: Scheduling shared continuous resources on many-cores. In: Proceedings of the 26th ACM Symposium on Parallelism inAlgorithms and Architectures (SPAA 2014), pp. 128–137. ACM (2014)Google Scholar
  3. 3.
    Chung, F., Graham, R., Mao, J., Varghese, G.: Parallelism versus memory allocation in pipelined router forwarding engines. Theory Comput. Syst. 39(6), 829–849 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    de la Vega, W.F., Lueker, G.S.: Bin packing can be solved within 1+epsilon in linear time. Combinatorica 1(4), 349–355 (1981)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Dósa, G., Li, R., Han, X., Tuza, Z.: Tight absolute bound for first fit decreasing bin-packing: FFD(l) \(\le \) 11/9 OPT(L) + 6/9. Theoret. Comput. Sci. 510, 13–61 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Epstein, L., Levin, A., van Stee, R.: Approximation schemes for packing splittable items with cardinality constraints. Algorithmica 62(1–2), 102–129 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Epstein, L., van Stee, R.: Approximation schemes for packing splittable items with cardinality constraints. In: Kaklamanis, C., Skutella, M. (eds.) WAOA 2007. LNCS, vol. 4927, pp. 232–245. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  8. 8.
    Epstein, L., van Stee, R.: Improved results for a memory allocation problem. Theory Comput. Syst. 48(1), 79–92 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Happe, M., auf der Heide, F.M., Kling, P., Platzner, M., Plessl, C.: 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 2013), pp. 1–10. IEEE Computer Society (2013)Google Scholar
  10. 10.
    Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (FOCS 1982), pp. 312–320. IEEE Computer Society (1982)Google Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  • Jürgen König
    • 1
  • Alexander Mäcker
    • 1
  • Friedhelm Meyer auf der Heide
    • 1
  • Sören Riechers
    • 1
    Email author
  1. 1.Heinz Nixdorf Institute and Computer Science DepartmentPaderborn UniversityPaderbornGermany

Personalised recommendations