Deadline assignment in a distributed soft real-time system

Author

Kao, Ben ; Garcia-Molina, Hector

Author_Institution

Dept. of Comput. Sci., Stanford Univ., CA, USA

fYear

1993

fDate

25-28 May 1993

Firstpage

428

Lastpage

437

Abstract

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

Keywords

distributed processing; operating systems (computers); real-time systems; scheduling; application design; deadline assignment; distributed soft real-time system; distributed task; multiple sites; processing demands; real-time system; simulations; subtask deadline assignment; Computer science; Image sensors; Processor scheduling; Radar imaging; Radar tracking; Real time systems; Sensor phenomena and characterization; Sensor systems; Spatial databases; Surveillance;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Conference_Location

Pittsburgh, PA

Print_ISBN

0-8186-3770-6

Type

conf

DOI

10.1109/ICDCS.1993.287682

Filename

287682