Deterministic Data Flow eliminates timing anomalies in cause-effect chain end-to-end latency with negligible average latency impact and a formal proof of the property.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
FPGA optimizations for pulsar-search matched filters achieve slightly better performance per watt than a top-end GPU despite lower absolute speed.
citing papers explorer
-
Scheduling Cause-Effect Chains without Timing Anomalies in End-to-End Latency
Deterministic Data Flow eliminates timing anomalies in cause-effect chain end-to-end latency with negligible average latency impact and a formal proof of the property.
-
FPGA-based Matched Filter Group Optimisation for SKA Pulsar Search Engine
FPGA optimizations for pulsar-search matched filters achieve slightly better performance per watt than a top-end GPU despite lower absolute speed.