Soft Real-Time Tasks Scheduling Based on Dynamic Timing Constraints in Fixed Priority Preemptive Systems.

Maxim V. Kavalerov: Soft Real-Time Tasks Scheduling Based on Dynamic Timing Constraints in Fixed Priority Preemptive Systems CSIT 2000 : 319-322

Abstract

This paper addresses the problem of soft real-time tasks scheduling in fixed priority preemptive systems. The new approach based on dynamic timing constraints is proposed.

Copyright © 2000 by the Institute for Contemporary Education "JurInfoR-MSU". Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the CSIT copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Institute for Contemporary Education JMSUICE. To copy otherwise, or to republish, requires a fee and/or special permission from the JMSUICE.

Printed Edition

Heinz Schweppe and Yuri S. Kabalnov (Eds.): CSIT'2000, Proceedings of 2nd International Workshop on Computer Science and Information Technologies, September 18-23, 2000, Ufa, Russia. USATU Publishers & JurInfoR-MSU Publishing 2000, ISBN 5-86911-312-1

Electronic Edition