Deadline Assignment in a Distributed Soft Real-Time System (1993)
| Venue: | IEEE Transactions on Parallel and Distributed Systems |
| Citations: | 80 - 6 self |
BibTeX
@INPROCEEDINGS{Kao93deadlineassignment,
author = {Ben Kao and Hector Garcia-molina},
title = {Deadline Assignment in a Distributed Soft Real-Time System},
booktitle = {IEEE Transactions on Parallel and Distributed Systems},
year = {1993},
pages = {428--437}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In a distributed environment, tasks often have processing demands on multiple different 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. However, the problem of how a global deadline is automatically translated to the deadline of each individual subtask has not been well studied. This paper examines (through simulations) four strategies for subtask deadline assignment in a distributed soft real-time environment. Keywords: soft real-time, distributed systems, deadline assignment, scheduling. 1 Introduction Consider a radar surveillance system whose task is to track flying objects, decide whether an object is friendly or hostile, and in the latter case, come up with a combat strategy. This system requires the cooperation of several different components: a radar sensor componen...
