scispace - formally typeset
Open Access

On the management of latency in the synthesis of real-time signal processing systems from processing graphs

Reads0
Chats0
TLDR
This research is the first to model the execution of processing graphs with the real-time RBE model, and appears to be theFirst to identify and quantify inherent latency in processing graphs.
Abstract
Complex digital signal processing systems are commonly developed using directed graphs called processing graphs. Processing graphs are large grain dataflow graphs in which nodes represent processing functions and graph edges depict the flow of data from one node to the next. When sufficient data arrives, a node executes its function from start to finish without synchronization with other nodes, and appends data to the edge connecting it to a consumer node. We combine software engineering techniques with real-time scheduling theory to solve the problem of transforming a processing graph into a predictable real-time system in which latency can be managed. For signal processing graphs, real-time execution means processing signal samples as they arrive without losing data. Latency is defined as the time between when a sample of sensor data is produced and when the graph outputs the processed signal. We study a processing graph method, called PGM, developed by the U.S. Navy for embedded signal processing applications. We present formulae for computing node execution rates, techniques for mapping nodes to tasks in the rate-based-execution (RBE) task model, and conditions to verify the schedulability of the resulting task set under a rate-based, earliest-deadline-first scheduling algorithm. Furthermore, we prove upper and lower bounds for the total latency any sample will encounter in the system. We show that there are two sources of latency in real-time systems created from processing graphs: inherent and imposed latency. Inherent latency is the latency defined by the dataflow attributes and topology of the processing graph. Imposed latency is the latency imposed by the scheduling and execution of nodes m the graph. We demonstrate our synthesis method and the management of latency using three applications from the literature and industry: a synthetic aperture radar application, an INMARSAT mobile satellite receiver application, and an acoustic signal processing application from the ALFS anti-submarine warfare system. This research is the first to model the execution of processing graphs with the real-time RBE model, and appears to be the first to identify and quantify inherent latency in processing graphs.

read more

Citations
More filters

私の computer 環境

秀逸 原田
TL;DR: The longman elect new senior secondary theme book is a brand new task-based coursebook specially designed to meet the aims of the new high school curriculum for secondary 4 to 6 building on the solid foundation of knowledge skills values and attitudes laid down in the widely successful Longman elect junior secondary series as discussed by the authors.
Proceedings ArticleDOI

Hard-real-time scheduling of data-dependent tasks in embedded streaming applications

TL;DR: This paper analytically proves that in more than 80% of the cases, the throughput resulting from the approach is equal to the maximum achievable throughput of an application for a set of 19 real streaming applications.
Book ChapterDOI

Analyzing Global-EDF for Multiprocessor Scheduling of Parallel Tasks

TL;DR: This schedulability test guarantees that all deadlines are met when tasks are scheduled with global-EDF, assuming that the system analyzed with the schedulable test is provided processors of twice the speed.
Journal ArticleDOI

On the hard-real-time scheduling of embedded streaming applications

TL;DR: This work proves that the actors in acyclic Cyclo-Static Dataflow (CSDF) graphs can be scheduled as periodic tasks, and provides a framework for computing the periodic task parameters of each actor, and handling sporadic input streams.
Proceedings ArticleDOI

Supporting Soft Real-Time DAG-Based Systems on Multiprocessors with No Utilization Loss

TL;DR: This paper is the first to show that bounded tardiness can be ensured for globally-scheduled DAG-based applications without utilization loss.
References
More filters
Book

Scheduling algorithms for multiprogramming in a hard real-time environment

TL;DR: In this paper, the problem of multiprogram scheduling on a single processor is studied from the viewpoint of the characteristics peculiar to the program functions that need guaranteed service, and it is shown that an optimum fixed priority scheduler possesses an upper bound to processor utilization which may be as low as 70 percent for large task sets.
Proceedings ArticleDOI

The rate monotonic scheduling algorithm: exact characterization and average case behavior

TL;DR: An exact characterization of the ability of the rate monotonic scheduling algorithm to meet the deadlines of a periodic task set and a stochastic analysis which gives the probability distribution of the breakdown utilization of randomly generated task sets are represented.
Journal ArticleDOI

Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing

TL;DR: This self-contained paper develops the theory necessary to statically schedule SDF programs on single or multiple processors, and a class of static (compile time) scheduling algorithms is proven valid, and specific algorithms are given for scheduling SDF systems onto single ormultiple processors.
Journal ArticleDOI

On the complexity of fixed-priority scheduling of periodic, real-time tasks

TL;DR: It is shown that the problem is NP-hard in all but one special case and the complexity of optimal fixed-priority scheduling algorithm is discussed.
Dissertation

Fundamental design problems of distributed systems for the hard-real-time environment

TL;DR: This work shall provide a graph-based computation model which is more suitable for expressing the computation requirements of the real-time environment, and is an extension of CONSORT (Control Structure Optimized for Real-Time), an experimental software design system.