Scheduling on Two Unbounded Resources with Communication Costs

DOI10.1007/978-3-030-29400-7_9zbMath1437.68032OpenAlexW2936537273MaRDI QIDQ3297565

Alix Munier Kordon, Guillaume Pallez, Massinissa Ait Aba

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

schedulingmakespanDAGheterogeneous platform

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Server cloud scheduling ⋮ Server cloud scheduling

Cites Work

• The Recognition of Series Parallel Digraphs
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• A Family of Scheduling Algorithms for Hybrid Parallel Platforms
• Reducibility among Combinatorial Problems
• Low-Cost Approximation Algorithms for Scheduling Independent Tasks on Hybrid Platforms

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