Abstraction and control techniques for non-stationary scheduling problems
Adaptation and Self-Organizing Systems
2009-12-02 v1 Distributed, Parallel, and Cluster Computing
Abstract
The paper faces the problem of scheduling from a new perspective, trying to bridge the gap between classical heuristic approaches and system identification and control strategies. To this aim, a complete mathematical formulation of a general scheduling process is derived, beginning from very broad assumptions. This allows a greater freedom of manipulation and guarantee the resolution of the identification (and control) techniques. Both an adaptive and a switching strategies are presented in relation to the performances of a simple Round Robin algorithm.
Keywords
Cite
@article{arxiv.0912.0032,
title = {Abstraction and control techniques for non-stationary scheduling problems},
author = {Giacomo Innocenti and Luca Pretini},
journal= {arXiv preprint arXiv:0912.0032},
year = {2009}
}
Comments
26 pages, 10 figures, technical (internal) report of the Dipartimento di sistemi e Informatica, Universita' di Firenze