Go to content
UR Home

Applying heuristic methods for job scheduling in storage markets

URN to cite this document:
urn:nbn:de:bvb:355-epub-212926
Finkbeiner, Josef ; Bodenstein, Christian ; Schryen, Guido ; Neumann, Dirk
[img]
Preview
PDF
(143kB)
Date of publication of this fulltext: 27 Jun 2011 06:30


Abstract

In double-sided markets for computing resources an optimal allocation schedule among job offers and requests subject to relevant capacity constraints can be determined. With increasing storage demands and emerging storage services the question how to schedule storage jobs becomes more and more interesting. Since such scheduling problems are often in the class NP-complete an exact computation is ...

plus


Owner only: item control page
  1. Homepage UR

University Library

Publication Server

Contact:

Publishing: oa@ur.de

Dissertations: dissertationen@ur.de

Research data: daten@ur.de

Contact persons