International Conference on Parallel Computing in Electrical Engineering (PARELEC'00)
Download PDF

Abstract

Reconfigurable Accelerators (RAs) have the potential to provide significant speed-up over many traditional software implementations. However, their effective performance is often limited by their IO capabilities rather than by their computational power. Hence, it became important to consider these constraints when implementing an algorithm on such architecture. In this paper, we propose an IO conscious optimal partitioning strategy for RA based regular array implementations.
Like what you’re reading?
Already a member?
Get this article FREE with a new membership!