Scheduling shared continuous resources on many-cores

DOI10.1007/s10951-017-0518-0zbMath1406.90033OpenAlexW2607302740WikidataQ59202477 ScholiaQ59202477MaRDI QIDQ1617293

Peter Kling, Tim Süß, Ernst Althaus, Friedhelm Meyer auf der Heide, André Brinkmann, Jiří Sgall, Sören Riechers, Lars Nagel

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

zbMATH Keywords

schedulingapproximation algorithmsresources

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

Scheduling with interjob communication on parallel processors ⋮ On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games ⋮ Scheduling with Interjob Communication on Parallel Processors ⋮ Multi-core processor scheduling with respect to data bus bandwidth

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Project scheduling with finite or infinite number of activity processing modes -- a survey
• Parallelism versus memory allocation in pipelined router forwarding engines
• Discrete-continuous scheduling problems -- mean completion time results
• Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs
• On a methodology for discrete-continuous scheduling
• Solving the discrete-continuous project scheduling problem via its discretization
• 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
• Improved results for a memory allocation problem
• A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
• Survey of scheduling techniques for addressing shared resources in multicore processors
• Resource Management in Machine Scheduling Problems: A Survey
• Handbook on Scheduling

This page was built for publication: Scheduling shared continuous resources on many-cores