Scheduling on Two Unbounded Resources with Communication Costs

DOI10.1007/978-3-030-29400-7_9MaRDI QIDQ3297565zbMATH OpenOpenAlexFDO

Authors Massinissa Ait Aba, Alix Munier-Kordon, Guillaume Pallez

Publication date 20 July 2020

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-02076473/file/version_hal.pdf

zbMATH Keywords

DAGheterogeneous platformmakespanscheduling

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) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Recommendations

• Unconstrained static scheduling with communication weights
• Approximation algorithms for scheduling with a limited number of communications
• Scheduling complete intrees on two uniform processors with communication delays
• On the complexity of scheduling with large communication delays
• Task scheduling with and without communication delays: A unified approach
• Scheduling jobs with communication delays: using infeasible solutions for approximation
• scientific article; zbMATH DE number 1061006
• Two-agent scheduling on an unbounded serial batching machine
• Unbounded parallel-batching scheduling with two competitive agents
• Complexity of Task Graph Scheduling with Fixed Communication Capacity

Cites work

• A family of scheduling algorithms for hybrid parallel platforms
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• Low-cost approximation algorithms for scheduling independent tasks on hybrid platforms
• Reducibility among combinatorial problems
• The Recognition of Series Parallel Digraphs

Cited in

(4)

• Server cloud scheduling
• Parallel Processing and Applied Mathematics
• Server cloud scheduling
• A fixed-parameter algorithm for scheduling unit dependent tasks with unit communication delays

This page was built for publication: Scheduling on Two Unbounded Resources with Communication Costs

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