On the public citation graph

Fully static multiprocessor array realizability criteria for real-time recurrent DSP applications

0 signed · 27 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/12.73588openalex-snapshot
Static rate-optimal scheduling of iterative data-flow programs via optimum unfolding
inferredcites →https://doi.org/10.1109/5.48830openalex-snapshot
Algorithm transformation techniques for concurrent processors
inferredcites →https://doi.org/10.1109/81.139286openalex-snapshot
Range-chart-guided iterative data-flow graph scheduling
inferredcites →https://doi.org/10.1109/asap.1992.218537openalex-snapshot
Fully static multiprocessor realization for real-time recursive DSP algorithms
inferredcites →https://doi.org/10.1109/icassp.1991.150512openalex-snapshot
A globally static rate optimal scheduling for recursive DSP algorithms
inferredcites →https://doi.org/10.1109/icassp.1991.150553openalex-snapshot
Optimal scheduling of linear recurrence equations on a multiprocessor array
inferredcites →https://doi.org/10.1109/icassp.1992.226557openalex-snapshot
Unfolding and retiming data-flow DSP programs for RISC multiprocessor scheduling
inferredcites →https://doi.org/10.1145/321479.321485openalex-snapshot
Scheduling Parallel Computations

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-540-30501-9_75openalex-snapshot
Stochastic DFS for Multiprocessor Scheduling of Cyclic Taskgraphs
inferred← citeshttps://doi.org/10.1016/j.ifacol.2018.09.064openalex-snapshot
Identification of two dimensional complex sinusoids in white noise: a state-space frequency approach
inferred← citeshttps://doi.org/10.1016/j.ifacol.2018.09.125openalex-snapshot
2D-frequency domain identification of complex sinusoids in the presence of additive noise
inferred← citeshttps://doi.org/10.1109/78.950795openalex-snapshot
Parameterized dataflow modeling for DSP systems
inferred← citeshttps://doi.org/10.1109/81.329729openalex-snapshot
Rate optimal scheduling of recursive DSP algorithms by unfolding
inferred← citeshttps://doi.org/10.1109/92.406997openalex-snapshot
Multiprocessor implementation of real-time DSP algorithms
inferred← citeshttps://doi.org/10.1109/acssc.1998.751523openalex-snapshot
Optimal bipartite multi-processor implementation of recurrent DSP algorithm with fixed communication delay
inferred← citeshttps://doi.org/10.1109/aspdac.2011.5722178openalex-snapshot
Minimizing buffer requirements for throughput constrained parallel execution of synchronous dataflow graph
inferred← citeshttps://doi.org/10.1109/dac.1998.724451openalex-snapshot
Rate optimal VLSI design from data flow graph
inferred← citeshttps://doi.org/10.1109/estimedia.2011.6088529openalex-snapshot
Resource minimized static mapping and dynamic scheduling of SDF graphs
inferred← citeshttps://doi.org/10.1109/glsv.1996.497584openalex-snapshot
Synthesis of real-time recursive DSP algorithms using multiple chips
inferred← citeshttps://doi.org/10.1109/icassp.1999.758321openalex-snapshot
Minimum initiation interval of multi-module recurrent signal processing algorithm realization with fixed communication delay
inferred← citeshttps://doi.org/10.1109/icassp.2000.860121openalex-snapshot
Parameterized dataflow modeling of DSP systems
inferred← citeshttps://doi.org/10.1109/socdc.2010.5682911openalex-snapshot
Buffer optimal static scheduling with a throughput constraint for synchronous dataflow applications on multiprocessors
inferred← citeshttps://doi.org/10.1109/vlsisp.1994.574741openalex-snapshot
Processor-optimal implementation of real-time DSP algorithms
inferred← citeshttps://doi.org/10.1142/s0219265913500114openalex-snapshot
Energy-Aware Scheduling for Acyclic Synchronous Data Flows on Multiprocessors
inferred← citeshttps://doi.org/10.1155/s1110865702205053openalex-snapshot
High-Level Synthesis of DSP Applications Using Adaptive Negative Cycle Detection
inferred← citeshttps://doi.org/10.1504/ijhpcn.2005.007868openalex-snapshot
A new strategy for multiprocessor scheduling of cyclic task graphs
inferred← citeshttps://doi.org/10.5555/1950815.1950860openalex-snapshot
Minimizing buffer requirements for throughput constrained parallel execution of synchronous dataflow graph
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.