【24h】

Throughput-latency tradeoffs in concurrent communication and DSP systems

机译:并发通信和DSP系统中的吞吐量-延迟权衡

获取原文
获取外文期刊封面目录资料

摘要

The actual throughput, latency, and cost-effectiveness of feedback systems, concurrent recursive systems, and generalized concurrent systems are analyzed, and an overall design methodology is proposed. The differences between the throughput speedup, the iteration bound speedup, and the intrinsic throughput-latency tradeoffs in concurrent design are discussed. It is shown that the iteration bound can be relaxed at the expense of latency and that a concurrent system can achieve the relaxed iteration bound only if the recursion hardware is not pipelined and sufficient concurrency (sometimes higher than the improvement in the iteration bound) is available.
机译:分析了反馈系统,并发递归系统和广义并发系统的实际吞吐量,时延和成本效益,并提出了总体设计方法。讨论了并发设计中吞吐量加速,迭代边界加速和固有吞吐量-延迟权衡之间的差异。结果表明,可以放宽迭代边界,但以等待时间为代价,并且仅当递归硬件没有流水线并且有足够的并发性(有时高于迭代边界的改进)时,并发系统才能实现松弛的迭代边界。 。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号