Scheduling-free resource management

  • Authors:
  • Kees van Hee;Alexander Serebrenik;Natalia Sidorova;Marc Voorhoeve;Jan van der Wal

  • Affiliations:
  • Eindhoven University of Technology, Department of Mathematics and Computer Science, P.O. Box 513, 5600 MB Eindhoven, The Netherlands;Eindhoven University of Technology, Department of Mathematics and Computer Science, P.O. Box 513, 5600 MB Eindhoven, The Netherlands;Eindhoven University of Technology, Department of Mathematics and Computer Science, P.O. Box 513, 5600 MB Eindhoven, The Netherlands;Eindhoven University of Technology, Department of Mathematics and Computer Science, P.O. Box 513, 5600 MB Eindhoven, The Netherlands;Eindhoven University of Technology, Department of Mathematics and Computer Science, P.O. Box 513, 5600 MB Eindhoven, The Netherlands

  • Venue:
  • Data & Knowledge Engineering
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We investigate a resource management policy that allocates resources based on the number of available resources only. We formulate a condition on resource requesting processes, called solidity that guarantees successful termination. Processes that do not satisfy this condition can be modified to become solid. We investigate performance of the resource management policy proposed by comparing it to the theoretically found optimum for the special case. Our method can be applied in, for example, project management systems, orchestration software and workflow engines.