Scheduling shared continuous resources on many-cores
From MaRDI portal
Recommendations
- Resource level minimization in the discrete-continuous scheduling
- Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource
- On a methodology for discrete-continuous scheduling
- Approximation algorithms for scheduling on multi-core processor with shared speedup resources
- Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs
Cites work
- scientific article; zbMATH DE number 1306870 (Why is no real title available?)
- scientific article; zbMATH DE number 2109192 (Why is no real title available?)
- A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
- A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan
- Approximation schemes for packing splittable items with cardinality constraints
- Discrete-continuous scheduling problems -- mean completion time results
- Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs
- Handbook on Scheduling
- Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan
- Improved results for a memory allocation problem
- On a methodology for discrete-continuous scheduling
- Parallelism versus memory allocation in pipelined router forwarding engines
- Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines
- Project scheduling with finite or infinite number of activity processing modes -- a survey
- Resource management in machine scheduling problems: a survey
- Solving the discrete-continuous project scheduling problem via its discretization
- Survey of scheduling techniques for addressing shared resources in multicore processors
Cited in
(9)- Scheduling with interjob communication on parallel processors
- Multi-core processor scheduling with respect to data bus bandwidth
- Scheduling with interjob communication on parallel processors
- On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games
- Provably good multiprocessor scheduling with resource sharing
- Improved scheduling with a shared resource
- Survey of scheduling techniques for addressing shared resources in multicore processors
- Approximation algorithms for scheduling on multi-core processor with shared speedup resources
- Scheduling with an orthogonal resource constraint
This page was built for publication: Scheduling shared continuous resources on many-cores
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1617293)
