In this paper we present a general approach to resource management
called time-function scheduling (TFS). This scheduling method provides
effective and flexible control over resource allocation that can be used
to achieve different performance requirements for a large and diverse
set of scheduling objectives. We demonstrate these capabilities by
developing a prototype implementation of a relatively simple form of
TFS and experimentally comparing it against other approaches that have
appeared in the research literature. Our results show that TFS supports
a level of resource allocation control that is not possible under the
methods employed in many computing environments. We also show that TFS
can achieve the same relative execution rates of the recently proposed
lottery scheduling mechanism while considerably reducing the variability
in response. Furthermore, TFS provides very fast and stable convergence
to the desired resource allocation goals. These results are obtained
with a simple, straightforward implementation of TFS that exhibits
overheads comparable to lottery scheduling.
By: Liana L. Fong and Mark S. Squillante
Published in: RC20155 in 1995
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .