By Topic

Deadline assignment in a distributed soft 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)
Kao, B. ; Dept. of Comput. Sci., Stanford Univ., CA, USA ; Garcia-Molina, H.

In a distributed environment, tasks often have processing demands on multiple sites. A distributed task is usually divided up into several subtasks, each one to be executed at some site in order. In a real-time system, an overall deadline is usually specified by an application designer indicating when a distributed task is to be finished. To study the subtask deadline assignment problem a simple model of the system and tasks is postulated. The focus is on soft real-time systems. In such systems, it is very difficult to guarantee that all deadlines will be met, and hence one tries to minimize the number of deadlines that are missed. The authors examine (through simulations) four strategies for subtask deadline assignment in a distributed soft real-time environment

Published in:

Distributed Computing Systems, 1993., Proceedings the 13th International Conference on

Date of Conference:

25-28 May 1993