On the public citation graph

Scheduling synchronous dataflow graphs for efficient looping

0 signed · 48 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1109/29.46557openalex-snapshot
Gabriel: a design environment for DSP
inferredcites →https://doi.org/10.1109/53.16926openalex-snapshot
Programmable DSP architectures. I
inferredcites →https://doi.org/10.1109/53.16934openalex-snapshot
Programmable DSP architectures. II
inferredcites →https://doi.org/10.1109/53.665openalex-snapshot
Beamforming: a versatile approach to spatial filtering
inferredcites →https://doi.org/10.1109/proc.1987.13876openalex-snapshot
Synchronous data flow
inferredcites →https://doi.org/10.1109/tc.1987.5009446openalex-snapshot
Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing
inferredcites →https://doi.org/10.1117/12.962367openalex-snapshot
Automatic Mapping Of Large Signal Processing Systems To A Parallel Machine

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-29970-4_1openalex-snapshot
SCAPE: HW-Aware Clustering of Dataflow Actors for Tunable Scheduling Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-46824-0_2openalex-snapshot
Modellierung
inferred← citeshttps://doi.org/10.1007/bf01383830openalex-snapshot
Looped schedules for dataflow descriptions of multirate signal processing algorithms
inferred← citeshttps://doi.org/10.1007/s10766-013-0277-2openalex-snapshot
Evaluation of Speculation in Out-of-Order Execution of Synchronous Dataflow Networks
inferred← citeshttps://doi.org/10.1016/b978-155860702-6/50040-5openalex-snapshot
Generating Compact Code from Dataflow Specifications of Multirate Signal Processing Algorithms Manuscript received May 25, 1993 December 1, 1994 This work was part of the Ptolemy project, supported by the Advanced Research Projects Agency and U. S. Air Force (RASSP program, Contract…
inferred← citeshttps://doi.org/10.1016/j.sysarc.2024.103217openalex-snapshot
Automated level-based clustering of dataflow actors for controlled scheduling complexity
inferred← citeshttps://doi.org/10.1023/a:1008633809454openalex-snapshot
Joint Minimization of Code and Data for Synchronous Dataflow Programs
inferred← citeshttps://doi.org/10.1023/a:1008806425898openalex-snapshot
APGAN and RPMC: Complementary Heuristics for Translating DSP Block Diagrams into Efficient Software Implementations
inferred← citeshttps://doi.org/10.1023/a:1015452903532openalex-snapshot
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
inferred← citeshttps://doi.org/10.1109/43.806800openalex-snapshot
Improving the observability and controllability of datapaths for emulation-based debugging
inferred← citeshttps://doi.org/10.1109/78.295199openalex-snapshot
Memory management for dataflow programming of multirate signal processing algorithms
inferred← citeshttps://doi.org/10.1109/81.376876openalex-snapshot
Generating compact code from dataflow specifications of multirate signal processing algorithms
inferred← citeshttps://doi.org/10.1109/asap.1993.397152openalex-snapshot
Optimum vectorization of scalable synchronous dataflow graphs
inferred← citeshttps://doi.org/10.1109/asap.1994.331814openalex-snapshot
Minimizing memory requirements in rate-optimal schedules
inferred← citeshttps://doi.org/10.1109/cacwd.2004.1348979openalex-snapshot
A concurrent design approach for data flow dominated embedded systems
inferred← citeshttps://doi.org/10.1109/date.2011.5763094openalex-snapshot
A rule-based static dataflow clustering algorithm for efficient embedded software synthesis
inferred← citeshttps://doi.org/10.1109/emsoft.2015.7318274openalex-snapshot
Static memory management for efficient mobile sensing applications
inferred← citeshttps://doi.org/10.1109/estimedia.2015.7351766openalex-snapshot
Quasi-static scheduling of data flow graphs in the presence of limited channel capacities
inferred← citeshttps://doi.org/10.1109/hicss.1998.649213openalex-snapshot
Rapid prototyping of dataflow programs on hardware/software architectures
inferred← citeshttps://doi.org/10.1109/hsc.1998.666236openalex-snapshot
Domain-specific interface generation from dataflow specifications
inferred← citeshttps://doi.org/10.1109/icassp.1993.319147openalex-snapshot
Scheduling dynamic dataflow graphs with bounded memory using the token flow model
inferred← citeshttps://doi.org/10.1109/icassp.1993.319153openalex-snapshot
Representing and exploiting data parallelism using multidimensional dataflow diagrams
inferred← citeshttps://doi.org/10.1109/icassp.1995.480105openalex-snapshot
Fine grain code synthesis within a block diagram oriented code generation environment
inferred← citeshttps://doi.org/10.1109/icassp.1995.480106openalex-snapshot
Scheduling for optimum data memory compaction in block diagram oriented software synthesis
inferred← citeshttps://doi.org/10.1109/icassp.1996.550588openalex-snapshot
Hierarchization of a priori defined dataflow subgraphs
inferred← citeshttps://doi.org/10.1109/iccad.2000.896448openalex-snapshot
Symbolic debugging scheme for optimized hardware and software
inferred← citeshttps://doi.org/10.1109/icpca.2007.4365510openalex-snapshot
The Data-Driven Multithreading Programming Model Based on DDF
inferred← citeshttps://doi.org/10.1109/isss.1998.730615openalex-snapshot
Memory efficient software synthesis from dataflow graph
inferred← citeshttps://doi.org/10.1109/iwrsp.1995.518591openalex-snapshot
Converting graphical DSP programs into memory constrained software prototypes
inferred← citeshttps://doi.org/10.1109/iwrsp.1997.618841openalex-snapshot
Software synthesis for dynamic data flow graph
inferred← citeshttps://doi.org/10.1109/samos.2012.6404171openalex-snapshot
Out-Of-order execution of synchronous data-flow networks
inferred← citeshttps://doi.org/10.1109/vlsisp.1993.404488openalex-snapshot
A scheduling framework for minimizing memory requirements of multirate DSP systems represented as dataflow graphs
inferred← citeshttps://doi.org/10.1145/1450058.1450084openalex-snapshot
A generalized static data flow clustering algorithm for mpsoc scheduling of multimedia applications
inferred← citeshttps://doi.org/10.1145/1880050.1880054openalex-snapshot
Analysis of SystemC actor networks for efficient synthesis
inferred← citeshttps://doi.org/10.1145/2442116.2442124openalex-snapshot
A rule-based quasi-static scheduling approach for static islands in dynamic dataflow graphs
inferred← citeshttps://doi.org/10.23919/eusipco58844.2023.10290113openalex-snapshot
Automated Clustering and Pipelining of Dataflow Actors for Controlled Scheduling Complexity
inferred← citeshttps://doi.org/10.3390/app11146649openalex-snapshot
A Measurement-Based Message-Level Timing Prediction Approach for Data-Dependent SDFGs on Tile-Based Heterogeneous MPSoCs
inferred← citeshttps://doi.org/10.5555/278241.278295openalex-snapshot
Domain-specific interface generation from dataflow specifications
inferred← citeshttps://doi.org/10.5555/2830865.2830886openalex-snapshot
Static memory management for efficient mobile sensing applications
inferred← citeshttps://doi.org/10.5555/293016.293043openalex-snapshot
Memory efficient software synthesis form dataflow graph
inferred← citeshttps://doi.org/10.70675/202a5ce2z626az4b57zb563za2e299a327b2openalex-snapshot
Model Based Granularity Optimization for High-Performance Computing Systems in Astronomy
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.