Synchronous (deterministic) data ow (SDF) has been exten- sively used to model ow constraints of digital signal processing (DSP) applications executed on (hard) real-time (RT) operating system (OS). Modern internet-of-things are, however, are often equipped with (soft) RTOSs such as embedded Linux. To reduce design iterations for the latter, the paper proposes a stochastic approach to SDF graphs where the response time of each node is modeled as probability density func- tion (pdf). With increasing number of iterations over the graph, the individual pdfs propagate through the network. The rst and second central moments of the resulting joint pdf correspond to the expected system latency and jitter, respectively. The scheduler may execute the code sequentially or in parallel. The proposed analysis tool is helpful in identifying bottlenecks within the system.
Static Data flow Analysis for Soft Real-Time System Design
Alexander Kocian;Stefano Chessa
In corso di stampa
Abstract
Synchronous (deterministic) data ow (SDF) has been exten- sively used to model ow constraints of digital signal processing (DSP) applications executed on (hard) real-time (RT) operating system (OS). Modern internet-of-things are, however, are often equipped with (soft) RTOSs such as embedded Linux. To reduce design iterations for the latter, the paper proposes a stochastic approach to SDF graphs where the response time of each node is modeled as probability density func- tion (pdf). With increasing number of iterations over the graph, the individual pdfs propagate through the network. The rst and second central moments of the resulting joint pdf correspond to the expected system latency and jitter, respectively. The scheduler may execute the code sequentially or in parallel. The proposed analysis tool is helpful in identifying bottlenecks within the system.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
