Scheduling Parallel DAG Jobs Online to Minimize Average Flow Time
From MaRDI portal
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)
Recommendations
- Scheduling parallelizable jobs online to maximize throughput
- Online parallel batching scheduling for nonincreasing-processing-time jobs to minimize the maximum flow-time
- On-line scheduling of parallel jobs
- Structural Information and Communication Complexity
- Scheduling parallel jobs online with convex and concave parallelizability
- Scheduling parallel jobs online with convex and concave parallelizability
- On-line scheduling of parallel jobs with runtime restrictions
- Online scheduling of malleable parallel jobs
- Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models
Cited in
(6)- Energy-efficient scheduling and routing via randomized rounding
- Open problems in queueing theory inspired by datacenter computing
- Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models
- scientific article; zbMATH DE number 7376042 (Why is no real title available?)
- Non-Clairvoyant Precedence Constrained Scheduling.
- Maximizing throughput for parallel jobs with speed-up curves
This page was built for publication: Scheduling Parallel DAG Jobs Online to Minimize Average Flow Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575590)
