Scheduling with interjob communication on parallel processors

DOI10.1007/978-3-319-48749-6_41MaRDI QIDQ2958346zbMATH OpenOpenAlexFDO

Authors Jürgen König, Alexander Mäcker, Friedhelm Meyer auf der Heide, Sören Riechers

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

Mathematics Subject Classification ID

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)

Recommendations

• Scheduling with interjob communication on parallel processors
• Approximation algorithms for scheduling trees with general communication delays: Special issue on task scheduling problems for parallel and distributed systems
• Complexity of Task Graph Scheduling with Fixed Communication Capacity
• Scheduling jobs with communication delays: using infeasible solutions for approximation
• Scheduling trees with large communication delays on two identical processors

Cites work

• Approximation schemes for packing splittable items with cardinality constraints
• Approximation Schemes for Packing Splittable Items with Cardinality Constraints
• Bin packing can be solved within 1+epsilon in linear time
• Improved results for a memory allocation problem
• Parallelism versus memory allocation in pipelined router forwarding engines
• Scheduling shared continuous resources on many-cores
• Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)

Cited in

(6)

• Approximation algorithms for scheduling trees with general communication delays: Special issue on task scheduling problems for parallel and distributed systems
• Scheduling with interjob communication on parallel processors
• An optimal algorithm for scheduling interval ordered tasks with communication on \(N\) processors
• Programming support and scheduling for communicating parallel tasks
• Complexity of Task Graph Scheduling with Fixed Communication Capacity
• scientific article; zbMATH DE number 2090583 (Why is no real title available?)

This page was built for publication: Scheduling with interjob communication on parallel processors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958346)