E. A. Lee and D. G. Messerschmitt, "Static scheduling of synchronous data flow programs for digital signal processing," IEEE Transactions on Computers, Vol. 36, No. 1, pp. 24--35, 1987. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Shared Buffer Implementations of Signal Processing Systems .. - Murthy, Bhattacharyya (2001) (1 citation) (Correct)
....constraints. An actor fires in a dataflow graph by removing tokens from its input edges and producing tokens on its output edges. The stream of tokens produced this way corresponds naturally to a discrete time signal in a DSP system. In this paper, we consider a subset of dataflow called SDF [17]. In SDF, each actor produces and consumes a fixed number of tokens, and these numbers are known at compile time. In addition, each edge has a fixed initial number of tokens, called delays. IV. NOTATION AND BACKGROUND Fig. 2(a) shows a simple SDF graph. Each edge is annotated with the number of ....
E. A. Lee and D. G. Messerschmitt, "Static scheduling of synchronous dataflow programs for digital signal processing," IEEE Trans. Comput., vol. C-36, pp. 24--35, Feb. 1987.
Springplay : A New Class of Compile-Time Scheduling.. - Paller, Wolinski (1995) (Correct)
....number of applications requiring high processing throughput in real time. These applications include various fields of Digital Signal Processing (radar signal processing, image processing) and high speed real time control systems. The restrictions imposed by the static data flow model presented in [1] are often ac ceptable in such applications and workarounds exist in the form of hybrid static dynamic schedulers [2] The static scheduling problem is NP complete in a strong sense [3] so it is attacked by different form of heuristics. These heuristics can be divided into four groups. 1. ....
....8 Springplay is compared with a Branch Bound class and with a Generalized List Scheduler class algorithm and in section 9 conclusions are drawn. At the end we present the schedule made by all the four algorithms on an example signalflow graph to demonstrate the advantage offered by Springplay. [1,4,4] required on the processors which take part in a given communication activity can be different. We suppose buffered asynchronous communic ation (nonblocking send, blocking receive) The amount of data units communicated among the tasks is constant and known in advance. The value to be ....
[Article contains additional citation context not shown here]
E. A. Lee and D. Messerschmitt, "Static scheduling of Synchronous Data Flow Programs for Digital Signal Processing," IEEE Trans. on Cornputers, vol C-36, pp. 24-35, No. 1, January
Modeling Of Block-Based Dsp Systems - Dong-Ik Ko And (2003) (Correct)
....tasks, and edges represent logical FIFO communication channels between tasks. A decidable dataflow model is one in which deadlock and unbounded buffer accumulation can be determined in finite time for every specification in the model. Examples of decidable dataflow models are CSDF [3] SDF [8], MDSDF [9] and SSDF [12] For consistent specifications in each of these models, there is a unique, integer valued repetitions vector that is indexed by the graph actors and gives the number of times each actor needs to be invoked to form a minimal periodic schedule for the graph. A number of ....
E. A. Lee and D. G. Messerschmitt. Static scheduling of synchronous dataflow programs for digital signal processing. IEEE Transactions on Computers, February 1987.
Synthesis of Embedded Software Using Free-Choice Petri.. - Sgroi, Lavagno.. (1999) (12 citations) (Correct)
....decisions as non deterministic choices, but they can not model external conditions or multiple rendezvous. The PN shown in figure 1b) is not a Free Choice Net, because there exists a marking in which transition t 3 is enabled and transition t 2 is not. Cyclic schedules SynchronousDataflow (SDF) [1] networks are a special case of Petri Nets, since they can be mapped into Marked Graphs where actors are transitions and arcs places. The approach proposed by Lee [1] to find a static schedule for an SDF graph is based on the notion of finite complete cycle. Given a Marked Graph and an initial ....
....there exists a marking in which transition t 3 is enabled and transition t 2 is not. Cyclic schedules SynchronousDataflow (SDF) 1] networks are a special case of Petri Nets, since they can be mapped into Marked Graphs where actors are transitions and arcs places. The approach proposed by Lee [1] to find a static schedule for an SDF graph is based on the notion of finite complete cycle. Given a Marked Graph and an initial marking, or equivalently a SDF graph and an initial configuration of tokens, a finite complete cycle is a sequence of transition firings that returns the net to its ....
[Article contains additional citation context not shown here]
E.A.Lee and D.G.Messerschmitt. Static scheduling of synchronous dataflow programs for digital signal processing. IEEE Transactions on computers, January 1987.
Behavioral Level Guidance Using Property-Based Design.. - Lisa Marie Guerra (1996) (1 citation) (Correct)
No context found.
E. A. Lee and D. G. Messerschmitt, "Static scheduling of synchronous data flow programs for digital signal processing," IEEE Transactions on Computers, Vol. 36, No. 1, pp. 24--35, 1987.
Unknown - The Pleiades Architecture (Correct)
No context found.
E. A. Lee and D. G. Messerschmitt, "Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing," IEEE Transactions on Computers, pp. 24-35, January 1987.
Algorithm Selection: - Quantitative Optimization-Intensive.. (Correct)
No context found.
E. A. Lee and D. G. Messerschmitt, "Static scheduling of synchronous dataflow programs for digital signal processing," IEEE Trans. Comput., vol. C-36, pp. 24--35, Jan. 1987.
A Generalization of Multidimensional Synchronous Dataflow . . . - Murthy (1995) (Correct)
No context found.
E. A. Lee, D. G Messerschmitt, "Static Scheduling of Synchronous Dataflow Programs for Digital Signal Processing, " IEEE Trans. on Computers, Jan. 1987
N-Synchronous Kahn Networks - A Relaxed Model of.. - Cohen, Duranton.. (Correct)
No context found.
D. G. Messerschmitt E. A. Lee. Static scheduling of synchronous data flow programs for digital signal processing. IEEE Trans. Computers, 36(1):24--25, 1987.
System Design for DSP Applications in Transaction Level.. - Deb, Jantsch, Öberg (2004) (Correct)
No context found.
E.A. Lee and D.G. Messerschmitt, "Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing," IEEE Trans. Comp., vol.C-36, no. 1, pp. 24-35, Jan. 1987.
Multidimensional Synchronous Dataflow - Murthy, Lee (2002) (4 citations) (Correct)
No context found.
E. A. Lee and D. G. Messerschmitt, "Static scheduling of synchronous data flow programs for digital signal processing," IEEE Trans. Comput., vol. C-36, pp. 24--35, Jan 1987.
A Two-Stage Solution Approach to Multidimensional.. - Verhaegh, Aarts.. (2001) (Correct)
No context found.
E. A. Lee and D. G. Messerschmitt, "Static scheduling of synchronous data-flow programs for digital signal processing," IEEE Trans. Comput., vol. C-36, pp. 24--35, Jan. 1987.
Models of Computation and Languages for Embedded System Design - Jantsch, Sander (2005) (Correct)
No context found.
E. A. Lee and D. G. Messerschmitt. Static scheduling of synchronous data flow programs for digital signal processing. IEEE Transactions on Computers, C-36(1):24--35, January 1987.
Models of Computation in the Design Process - Jantsch, Sander (2005) (Correct)
No context found.
E. A. Lee and D. G. Messerschmitt. Static scheduling of synchronous data flow programs for digital signal processing. IEEE Transactions on Computers, C36 (1):24--35, January 1987.
Resource Control for Synchronous Cooperative Threads - Amadio (2004) (Correct)
No context found.
E. Lee and D. Messerschmitt. Static scheduling of synchronous data flow programs for digital signal processing. IEEE Trans. on Computers, 1:24--35, 1987.
Spatial Computation - Budiu (2003) (Correct)
No context found.
E.A. Lee and D.A. Messerschmitt. Static scheduling of synchronous data flow programs for digital signal processing. IEEE Transactions on Computers (TOC), C36 (1):24--35, January 1987. 209
Specification and Analysis of Real-time Problem Solvers - Hamidzadeh, Shekhar (1993) (2 citations) (Correct)
No context found.
E. A. Lee and D. G. Messerschmitt, Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing, IEEE Transaction on Computers, pp. 24-35 (January, 1987).
Task-level Timing Models for Guaranteed.. - Poplavko, Basten, .. (2003) (1 citation) (Correct)
No context found.
Lee, E.A., and Messerschmitt, D.G., Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing. In IEEE Transactions on Computers, vol. 36, no. 1, 24-35, 1987.
Software Synthesis and Code Generation for Signal.. - Bhattacharyya.. (1999) (5 citations) (Correct)
No context found.
E. A. Lee and D. G. Messerschmitt. Static scheduling of synchronous dataflow programs for digital signal processing. IEEE Transactions on Computers, February 1987.
Overview Of The Ptolemy Project - Hylands, al. (2003) (5 citations) (Correct)
No context found.
E. A. Lee and D. G. Messerschmitt, "Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing," IEEE Trans. on Computers, January, 1987.
The Synthesis of Real-Time Systems from Processing Graphs - Goddard, Jeffay (2000) (Correct)
No context found.
Lee, E.A., Messerschmitt, D.G., "Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing, " IEEE Transactions on Computers, C-36(1), Jan. 1987, pp. 24-35.
Buffer Merging - A Powerful Technique for Reducing Memory.. - Murthy, Bhattacharyya (2004) (1 citation) (Correct)
No context found.
E. A. Lee, D. G. Messerschmitt, "Static Scheduling of Synchronous Dataflow Programs for Digital Signal Processing," IEEE Trans. on Computers, Feb., 1987.
Hierarchical Finite State Machines with Multiple Concurrency.. - Girault, Lee, Lee (1999) (25 citations) (Correct)
No context found.
E. A. Lee and D. G. Messerschmitt, "Static scheduling of synchronous data flow programs for digital signal processing," IEEE Trans. Comput., Jan. 1987.
Modelling and Implementation of a Vision System for Embedded.. - Andersson (2003) (Correct)
No context found.
E. A. Lee and D. G. Messerschmitt. Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing. IEEE transactions on computers, January 1987.
Hardware/Software Co-Design of Digital.. - Bolsens, De Man.. (1997) (13 citations) (Correct)
No context found.
E. A. Lee and D. G. Messerschmitt, "Static scheduling of synchronous data flow programs for digital signal processing," IEEE Trans. Computers, Jan. 1987.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC