We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Dynamic Resource Management Algorithm for a Distributed Real-time System

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

2 Author(s)
Cavanaugh, C. ; Center for Adv. Comput. Studies, Univ. of Louisiana, Lafayette, LA, USA ; Radhika Ari

In this paper we propose a framework and algorithm for dynamic resource management in a distributed real-time system. Our assumptions are as follows: first, multiple real-time & non real-time processes are active throughout the system. Those processes in the critical path for a given task, i.e., autopilot, fire control (as in firing weapons), surveillance, collaborative planning, are RT for the duration of the task and may or may not be party to multiple tasks in either critical or ancillary capacities. For instance, the radar may be part of the critical path during surveillance, but have uses other thaan that, say to take a snampshot during a collaborative planning sessiong that may serve an ancillary use (as a supplementary illusatration for discussion, e.g., "this is the depot we will go after tomorrow during a flyover") But then, if you can fly over it, why not go after it then? Another example: during a coordinated maneuver, plane-to-plane communications are in the critical path but during fire control they are not. Second, the operating system or run-time environment has task migration capabilities. Third, storage is cheap-can store images of multiple processes in different states on each computing device for purpose of instantiating one or more in any combination on that device and across devices for reconfigurable distributed computing. This paper presents a software architecture and an algorithm for resource management in such systems.

Published in:

Parallel and Distributed Processing Symposium, 2005. Proceedings. 19th IEEE International

Date of Conference:

04-08 April 2005