Decentralized Online Scheduling of Malleable NP-hard Jobs
From MaRDI portal
Publication:6487361
DOI10.1007/978-3-031-12597-3_8zbMATH Open1512.68048MaRDI QIDQ6487361FDOQ6487361
Authors: Peter Sanders, Dominik Schreiber 
Publication date: 9 December 2022
Recommendations
- Online scheduling of malleable parallel jobs
- Online malleable job scheduling for \(m\leq 3\)
- Decentralization and Mechanism Design for Online Machine Scheduling
- Competitive online scheduling of perfectly malleable jobs with setup times
- Improved upper bounds for online malleable job scheduling
- Online scheduling of moldable parallel tasks
- Online scheduling of malleable parallel jobs with setup times on two identical machines
- Mechanism design for decentralized online machine scheduling
- Improved algorithms for online scheduling of malleable parallel jobs on two identical machines
- Online Scheduling with Hard Deadlines on Parallel Machines
Online algorithms; streaming algorithms (68W27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15) Distributed systems (68M14)
Cites Work
- ManySAT: a parallel SAT solver
- The complexity of theorem-proving procedures
- A high-performance, portable implementation of the MPI message passing interface standard
- Sorting in \(c \log n\) parallel steps
- SAT competition 2020
- Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard
- Languages and Compilers for Parallel Computing
- Distributed cube and conquer with Paracooba
- Scalable SAT solving in the cloud
- Sequential and parallel algorithms and data structures. The basic toolbox
- Lilotane: a lifted SAT-based approach to hierarchical planning
- Robust massively parallel sorting
Cited In (5)
- Online over time processing of combinatorial problems
- Decentralized job scheduling in the cloud based on a spatially generalized \textit{Prisoner's Dilemma} game
- Decentralized subcontractor scheduling with divisible jobs
- Unsatisfiability proofs for distributed clause-sharing SAT solvers
- Decentralized online integer programming problems with a coupling cardinality constraint
This page was built for publication: Decentralized Online Scheduling of Malleable NP-hard Jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487361)
