A Software Synthesis Method for Building Real-Time Systems from Processing Graphs

In this paper, we present software synthesis techniques that create a real-time uniprocessor system from processing graphs. To achieve the synthesis, new rate theorems have been developed to derive the execution rate of each processing component in the graph. The processing graph is mapped to the existing Rate Based Execution (RBE) task model, and if the schedulability test for the resulting task set is affirmative, we show that efficient buffer management can be achieved using a simple Earliest Deadline First (EDF) scheduler. We evaluate our results using an International Maritime Satellite (INMARSAT) mobile receiver application. The case study shows that a dynamically scheduled implementation of the INMARSAT mobile satellite receiver uses less memory and introduces less latency than a comparable static implementation. 1 Introduction Processing graphs are a standard design aid in the development of complex digital signal processing systems. These directed graphs consist of nodes and..