Design of throughput-optimized arrays from recurrence abstractions

13 years 5 months ago

Download www.ccrc.wustl.edu

urrence abstractions Arpith C. Jacob Jeremy D. Buhler Roger D. Chamberlain Arpith C. Jacob, Jeremy D. Buhler, and Roger D. Chamberlain, "Design of ut-optimized arrays from recurrence abstractions," in Proc. of 21st IEEE International Conference on Application-specific Systems, Architectures and Processors, July 2010, pp. 133-140. Dept. of Computer Science and Engineering Washington University in St. Louis

Arpith C. Jacob, Jeremy D. Buhler, Roger D. Chambe

Real-time Traffic

Abstractions Arpith C | ASAP 2010 | Hardware | Jacob Jeremy | Roger D |

claim paper

» Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences

» Finding Loop Invariants for Programs over Arrays Using a Theorem Prover

» Converting to and from Dilated Integers

» Recurrent Associative Memory Network of Nonlinear Coupled Oscillators

» Revisiting SIMD Programming

» Gene Expression Analysis using Markov Chains extracted from RNNs

» On Increasing Signal Integrity with Minimal Decap Insertion in AreaArray SoC Floorplan Des...

» Proteinnetwork modeling of prostate cancer gene signatures reveals essential pathways in d...

Post Info
More Details (n/a)

Added	26 Oct 2010
Updated	26 Oct 2010
Type	Conference
Year	2010
Where	ASAP
Authors	Arpith C. Jacob, Jeremy D. Buhler, Roger D. Chamberlain

Comments (0)

Sciweavers

Design of throughput-optimized arrays from recurrence abstractions

Abstractions Arpith C | ASAP 2010 | Hardware | Jacob Jeremy | Roger D |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers