Abstract
We present an improved method for scheduling speculative data paths which relies on cancel tokens to undo computations in mis-speculated paths. Performancewise, this method is considerably faster than lenient execution, and faster than any other known approach applicable for general (including non-pipelined) computation structures. We present experimental evidence obtained by implementing our method as part of the high-level language hardware/software compiler COMRADE. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Gädke, H., & Koch, A. (2008). Accelerating speculative execution in high-level synthesis with cancel tokens. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4943 LNCS, pp. 185–195). https://doi.org/10.1007/978-3-540-78610-8_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
