Managing memory requirements in the synthesis of real-time systems from processing graphs
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
In the past, environmental restrictions on size, weight, and power consumption have severely limited both the processing and storage capacity of embedded signal processing systems. Today, however, as increases in processor speed and capabilities continually out pace increases in memory densities and performance, processor capacity is no longer a major concern for many signal processing applications-memory usage is now the primary concern. We present techniques for managing the memory requirements of signal processing applications in the synthesis of a real time uniprocessor system from processing graphs. To demonstrate the effectiveness of our memory management techniques, we compare the memory requirements of a statically scheduled implementation of an INMARSAT (International Maritime Satellite) mobile receiver, with our dynamic scheduling techniques. The case study demonstrates that state of the art, static schedulers use over 300% more memory than our simple, preemptive, EDF scheduler for a large class of signal processing applications.Keywords
This publication has 15 references indexed in Scilit:
- Bounding completion times of jobs with arbitrary release times and variable execution timesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Synchronization protocols in distributed real-time systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- High performance DSP software using data-flow graph transformationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Scheduling for optimum data memory compaction in block diagram oriented software synthesisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Software Synthesis from Dataflow GraphsPublished by Springer Nature ,1996
- Allocation and scheduling of precedence-related periodic tasksIEEE Transactions on Parallel and Distributed Systems, 1995
- Distributed Pipeline Scheduling: A Framework for Distributed, Heterogeneous Real-Time System DesignThe Computer Journal, 1995
- How to integrate precedence constraints and shared resources in real-time schedulingIEEE Transactions on Computers, 1994
- Static Scheduling of Synchronous Data Flow Programs for Digital Signal ProcessingIEEE Transactions on Computers, 1987
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973