Scheduling with Interjob Communication on Parallel Processors
From MaRDI portal
Publication:2958346
DOI10.1007/978-3-319-48749-6_41zbMath1483.68038OpenAlexW2544882735MaRDI QIDQ2958346
Friedhelm Meyer auf der Heide, Jürgen König, Sören Riechers, Alexander Mäcker
Publication date: 1 February 2017
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-48749-6_41
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cites Work
- Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)
- Parallelism versus memory allocation in pipelined router forwarding engines
- Bin packing can be solved within 1+epsilon in linear time
- Scheduling shared continuous resources on many-cores
- Approximation schemes for packing splittable items with cardinality constraints
- Improved results for a memory allocation problem
- Approximation Schemes for Packing Splittable Items with Cardinality Constraints
This page was built for publication: Scheduling with Interjob Communication on Parallel Processors
