Scheduling shared continuous resources on many-cores

© 2017 Springer Science+Business Media New York We consider the problem of scheduling a number of jobs on m identical processors sharing a continuously divisible resource. Each job j comes with a resource requirement [InlineEquation not available: see fulltext.]. The job can be processed at full spe...

Full description

Saved in:
Bibliographic Details
Main Authors: Ernst Althaus, Andre Brinkmann, Peter Kling, Friedhelm Meyer Auf der Heide, Lars Nagel, Soren Riechers, Jiri Sgall, Tim Suss
Format: Default Article
Published: 2017
Subjects:
Other information and computing sciences not elsewhere classified
Scheduling
Approximation algorithms
Resources
Information and Computing Sciences not elsewhere classified
Online Access:https://hdl.handle.net/2134/28395
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items