- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The work presents a specialized hardware accelerator for second-order recurrences arising in Continued-Fraction Networks (CoFrNets) and Chebyshev Kolmogorov-Arnold Networks (KANs). However, the novelty of the architectural techniques and the interpretation of cross-platform performance comparisons require further clarification.
Critical strengths
- Systematic hardware optimization. The paper identifies several practical bottlenecks. The proposed optimizations address these issues at different stages of the datapath rather than focusing on a single arithmetic operator.
- Substantial implementation and evaluation effort. The implementation results demonstrate considerable engineering effort and support the feasibility of the proposed design.
Critical weaknesses
- Insufficient justification of the specialized datapath. RONDO primarily combines general optimization techniques, including pipelined FMA units, interleaved execution, and parallel accumulation. While the implementation is effective, the paper does not sufficiently demonstrate what architectural advantages arise specifically from its fixed hardware scheduling. For eaxmple, Sections 2.3 and 5.2 emphasize RONDO's superior scaling efficiency over Ara, but it remains unclear whether the Ara implementation has been sufficiently optimized to exploit independent ladder computations through software scheduling and vectorization. Consequently, the comparison does not fully establish the benefits of the proposed specialized architecture over a programmable implementation of the same recurrence.
Questions for authors
-
How was the Ara RVV baseline programmed to exploit independent ladder computations? Were vectorization across ladders, loop unrolling, and instruction scheduling considered to reduce pipeline stalls? Could the authors clarify which limitations of the programmable architecture cannot be addressed through software optimization and therefore motivate RONDO's fixed scheduling approach?
-
Section 4.3 requires at least six independent ladder contexts per lane for stall-free execution, while the main experiments use 64 ladders distributed across up to eight lanes. How does RONDO perform when the number of independent ladders per lane falls below this requirement? Does the architecture introduce pipeline stalls, redistribute workloads across lanes, or interleave multiple inputs? How would these choices affect batch-1 latency and hardware utilization?
-
Inconsistent hardware specifications and presentation errors. Section 4.4 reports 16 MB of BRAM for the XC7K325T, whereas Section 5.3 reports approximately 2 MB. The former appears to be a unit error, as the device provides approximately 16 Mb of BRAM. Additionally, the Abstract identifies the CPU baseline as Ryzen 9960X, while Appendix A.5 specifies Ryzen 9 9950X, which are different processors. Section 3 also contains substantially duplicated descriptions in Steps 1 and 2. These inconsistencies should be corrected to improve the accuracy and reproducibility of the evaluation.
4 comments
Thank you to the authors for their response. I appreciate their efforts in revising the manuscript and conducting additional experiments. The authors have addressed most of my concerns. However, although the implementation is effective, RONDO primarily combines existing general-purpose optimisation techniques without introducing substantial methodological novelty or offering new insights into the challenges being addressed. Therefore, I still consider this work to be borderline, with neither a sufficiently strong reason to accept it nor a critical weakness that would clearly justify rejection.
Dear Reviewer,
As the discussion period ends today, we would appreciate your consideration of our rebuttal and additional results. We hope they address your concerns and would welcome any remaining questions. Thank you for your time and consideration.
We thank the reviewer for their comments and are grateful for the soundness score increase. However, we would argue that our work is not just an implementation of existing methods.
RONDO is more than a combination of existing methods. Our key insight concerns where the cost lies. CoFrNet ladders and Chebyshev KAN edges compute the same input-dependent second-order recurrence, yet the recurrence performs only 2% of the arithmetic. The dot products that generate its coefficients perform 98%, and moving their results took 63% of the FPGA lookup tables. Our interleaving is therefore not an implementation of C-slow retiming or barrel processing. Those methods rotate streams or threads that are already independent through one loop. RONDO instead decomposes each layer into independent accumulations and schedules them, together with the recurrence, under one rotation bound, Nd/NPAR ≥ L_fma + 1. Both stages then run without stalls or forwarding, and each coefficient keeps its accumulation order and is computed where it is used. One datapath serves both models, and an optimized vector processor still needs 5.2× more cycles.
We thank the reviewer again for their time and effort.
We thank the reviewer for the constructive questions, which we address below.
W1 / Q1 (Ara baseline). We thank the reviewer for this question. We have implemented and optimized the complete layer on Ara, which still needs 5.2× more cycles per ladder than RONDO.
Q2 (fewer ladders than slots). We thank the reviewer for this question. The slot count N is fixed at build time and must satisfy N ≥ L_fma + 1 = 6, and each lane of the evaluated layer holds eight ladders. When a lane holds n < N ladders (Section 4.3):
Q3 (inconsistencies). We thank the reviewer for the careful reading. All three are errors, and we have corrected each of them.