Scheduling shared continuous resources on many-cores
DOI10.1007/S10951-017-0518-0zbMATH Open1406.90033OpenAlexW2607302740WikidataQ59202477 ScholiaQ59202477MaRDI QIDQ1617293FDOQ1617293
Authors: Ernst Althaus, André Brinkmann, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel, Sören Riechers, Jiří Sgall, Tim Süß 
Publication date: 7 November 2018
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://figshare.com/articles/Scheduling_shared_continuous_resources_on_many-cores/9401894
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
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Title not available (Why is that?)
- Project scheduling with finite or infinite number of activity processing modes -- a survey
- Title not available (Why is that?)
- A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
- Handbook on Scheduling
- Solving the discrete-continuous project scheduling problem via its discretization
- Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines
- Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan
- Approximation schemes for packing splittable items with cardinality constraints
- Improved results for a memory allocation problem
- Parallelism versus memory allocation in pipelined router forwarding engines
- A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan
- On a methodology for discrete-continuous scheduling
- Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs
- Resource management in machine scheduling problems: a survey
- Discrete-continuous scheduling problems -- mean completion time results
- Survey of scheduling techniques for addressing shared resources in multicore processors
Cited In (9)
- Scheduling with interjob communication on parallel processors
- Scheduling with interjob communication on parallel processors
- On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games
- Improved scheduling with a shared resource
- Provably good multiprocessor scheduling with resource sharing
- 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
- Multi-core processor scheduling with respect to data bus bandwidth
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)
