By Topic

Dynamic scheduling for soft real-time distributed object systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kalogeraki, V. ; Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA, USA ; Melliar-Smith, P.M. ; Moser, L.E.

Distributed real-time applications require flexible and dynamic scheduling mechanisms to provide timeliness guarantees to application objects. In this paper we present a new scheduling algorithm that exploits the task laxities and the object importance to make effective scheduling decisions. The algorithm uses current timing and resource measurements to determine the feasibility of the tasks and to distribute the objects to the processors. A task's timing parameter (laxity value) is carried, from one processor to another, with the object invocations, yielding a system-wide scheduling strategy that requires only local computations. The algorithm aims to ensure that a low importance object does nor delay the execution of a high importance task

Published in:

Object-Oriented Real-Time Distributed Computing, 2000. (ISORC 2000) Proceedings. Third IEEE International Symposium on

Date of Conference: