A Mapping-Scheduling Algorithm for Hardware Acceleration on Reconfigurable Platforms



Downloads per month over past year

Clemente Barreira, Juan Antonio and Beretta, Ivan and Rana, Vincenzo and Atienza, David and Sciuto, Donatella (2014) A Mapping-Scheduling Algorithm for Hardware Acceleration on Reconfigurable Platforms. ACM Transactions on Reconfigurable Technology and Systems (TRETS), 7 (2). ISSN 1936-7406

[thumbnail of A Mapping-Scheduling Algorithm for Hardware Acceleration on Reconfigurable Platforms.pdf]

Official URL: http://dx.doi.org/10.1145/2611562


Reconfigurable platforms are a promising technology that offers an interesting trade-off between flexibility and performance, which many recent embedded system applications demand, especially in fields such as multimedia processing. These applications typically involve multiple ad-hoc tasks for hardware acceleration, which are usually represented using formalisms such as Data Flow Diagrams (DFDs), Data Flow Graphs (DFGs), Control and Data Flow Graphs (CDFGs) or Petri Nets. However, none of these models is able to capture at the same time the pipeline behavior between tasks (that therefore can coexist in order to minimize the application execution time), their communication patterns, and their data dependencies. This paper proves that the knowledge of all this information can be effectively exploited to reduce the resource requirements and the timing performance of modern reconfigurable systems, where a set of hardware accelerators is used to support the computation. For this purpose, this paper proposes a novel task representation model, named Temporal Constrained Data Flow Diagram (TCDFD), which includes all this information. This paper also presents a mapping-scheduling algorithm that is able to take advantage of the new TCDFD model. It aims at minimizing the dynamic reconfiguration overhead while meeting the communication requirements among the tasks. Experimental results show that the presented approach achieves up to 75% of resources saving and up to 89% of reconfiguration overhead reduction with respect to other state-of-the-art
techniques for reconfigurable platforms.

Item Type:Article
Additional Information:

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.

"© ACM, 2014. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM Transactions on Reconfigurable Technology and Systems (TRETS), {VOL 7, ISS 2, (June 2014)} http://doi.acm.org/10.1145/2611562"

Uncontrolled Keywords:Mapping, Task scheduling, Reconfiguration overheads, Reconfigurable systems, Run-time reconfiguration
Subjects:Sciences > Computer science > Hardware
ID Code:39516
Deposited On:19 Oct 2016 10:50
Last Modified:21 Oct 2016 10:49

Origin of downloads

Repository Staff Only: item control page