| | |
Summary: Supporting Soft Real-Time DAG-based Systems on Multiprocessors with
No Utilization Loss
Cong Liu and James H. Anderson
Department of Computer Science, University of North Carolina at Chapel Hill
Abstract
In work on globally-scheduled real-time multiprocessor
systems, analysis is lacking for supporting real-time appli-
cations developed using general processing graph models.
In this paper, it is shown that bounded deadline tardiness
can be ensured for such applications on a multiprocessor
with no utilization loss. This result is general: it is applica-
ble to periodic, sporadic, and rate-based directed-acyclic-
graph (DAG) models and allows sophisticated notions of
precedence to be supported (particularly, notions allowed
by the processing graph method). This paper is the first to
show that bounded tardiness can be ensured for globally-
scheduled DAG-based applications without utilization loss.
1 Introduction
In many real-time systems, applications are defined using
processing graphs [2,4], where vertices represent sequential
|
