Straight to the Queue: Fast Load-Store Queue Allocation in Dataflow Circuits-Reference-Cited by-同舟云学术

Straight to the Queue: Fast Load-Store Queue Allocation in Dataflow Circuits

Published:2023-02-12 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2023 ACM/SIGDA International Symposium on Field Programmable Gate Arrays
language:
Short-container-title:

Author:

Elakhras Ayatallah¹^ORCID,Sawhney Riya¹^ORCID,Guerrieri Andrea¹^ORCID,Josipovic Lana²^ORCID,Ienne Paolo¹^ORCID

Affiliation:

1. École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland

2. ETH Zurich, Zurich, Switzerland

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3543622.3573050

Reference20 articles.

1. Executing a program on the MIT tagged-token dataflow architecture

2. I-structures: data structures for parallel computing

3. M-structures: Extending a parallel, non-strict, functional language with state

4. Dataflow: A Complement to Superscalar

5. M. Budiu and S. C. Goldstein . Pegasus: An efficient intermediate representation . Technical Report Carnegie Mellon University-CS-02--107, Carnegie Mellon University , May 2002 . M. Budiu and S. C. Goldstein. Pegasus: An efficient intermediate representation. Technical Report Carnegie Mellon University-CS-02--107, Carnegie Mellon University, May 2002.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Survival of the Fastest: Enabling More Out-of-Order Execution in Dataflow Circuits;Proceedings of the 2024 ACM/SIGDA International Symposium on Field Programmable Gate Arrays;2024-04

2. A Unified Memory Dependency Framework for Speculative High-Level Synthesis;Proceedings of the 33rd ACM SIGPLAN International Conference on Compiler Construction;2024-02-17

3. A High-Frequency Load-Store Queue with Speculative Allocations for High-Level Synthesis;2023 International Conference on Field Programmable Technology (ICFPT);2023-12-12

4. Compiler Discovered Dynamic Scheduling of Irregular Code in High-Level Synthesis;2023 33rd International Conference on Field-Programmable Logic and Applications (FPL);2023-09-04