By Topic

End-to-end performance control for distributed real-time 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
$33 $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

2 Author(s)
H. A. Sholl ; Connecticut Univ., Storrs, CT, USA ; P. J. Pia

A best effort scheduling algorithm is used to reduce the probability of exceeding a deadline-related target time for each job class allocated to a distributed real-time system. A dynamic scheduler is used as a point of control on each node of a pipeline-structured distributed system. The authors contrast a local clustering scheduling algorithm which attempts to meet end-to-end timing requirements in isolation to a global clustering scheduling algorithm which attempts to meet end-to-end timing requirements by utilizing information about the state of other nodes in a job's execution path. The approach incorporates both job-class-based loss functions and feedback of remaining time estimates. A simulation study has shown that the global algorithm can provide an even distribution of processing power over all nodes and job classes while maintaining system stability

Published in:

System Sciences, 1993, Proceeding of the Twenty-Sixth Hawaii International Conference on  (Volume:ii )

Date of Conference:

5-8 Jan 1993