dc.contributor.author | Peltekis, Christodoulos | en |
dc.contributor.author | Filippas, Dionysios | en |
dc.contributor.author | Dimitrakopoulos, Giorgos | en |
dc.contributor.author | Nicopoulos, Chrysostomos | en |
dc.contributor.editor | Villar, Eugenio | en |
dc.creator | Peltekis, Christodoulos | en |
dc.creator | Filippas, Dionysios | en |
dc.creator | Dimitrakopoulos, Giorgos | en |
dc.creator | Nicopoulos, Chrysostomos | en |
dc.date.accessioned | 2023-12-19T16:22:45Z | |
dc.date.available | 2023-12-19T16:22:45Z | |
dc.date.issued | 2023-10-03 | |
dc.identifier.issn | 1872-9436 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/65823 | en |
dc.description.abstract | Systolic Array (SA) architectures are well-suited for accelerating matrix multiplications through the use of a pipelined array of Processing Elements (PEs) communicating with local connections and pre-orchestrated data movements. Even though most of the dynamic power consumption in SAs is due to multiplications and additions, pipelined data movement within the SA constitutes an additional important contributor. The goal of this work is to reduce the dynamic power consumption associated with the feeding of data to the SA, by employing both dynamic (run-time) and static (offline) techniques. At the hardware level, the proposed architecture synergistically applies bus-invert coding and zero-value clock gating. By exploiting salient attributes of state-of-the-art CNNs, such as the value distribution of the weights, the proposed SA applies appropriate encoding only to the data that exhibits high switching activity. Similarly, when one of the inputs is zero, unnecessary operations are entirely skipped. In addition to this duet of run-time techniques, the proposed methodology also leverages the inherent property of the weight matrix to remain unchanged throughout the inference phase. As such, the weight matrix is appropriately reordered offline to minimize the switching activity between consecutive values, as the matrix is repeatedly loaded into the array. The weight reordering process is formulated as a Traveling Salesman Problem (TSP) and its solution is translated into a switching-activity-aware row permutation of the weight matrix. The symbiotic combination of selectively targeted, application-aware dynamic encoding and offline weight reordering is demonstrated to reduce the switching activity by 38%, on average. This translates to an overall dynamic power reduction of 17.1%–23% when executing state-of-the-art CNN layers on an SA of size 32 × 32. These power savings scale with the array size; for an array of size 64 × 64, the proposed design consumes 29.7%–35.4% less power. | en |
dc.language.iso | eng | en |
dc.publisher | Elsevier | en |
dc.source | Microprocessors and Microsystems: Embedded Hardware Design (MICPRO) | en |
dc.source.uri | https://doi.org/10.1016/j.micpro.2023.104938 | en |
dc.source.uri | https://www.sciencedirect.com/science/article/pii/S0141933123001825 | en |
dc.subject | Systolic arrays | en |
dc.subject | Bus-invert coding | en |
dc.subject | Zero-value clock gating | en |
dc.subject | Weight reordering | en |
dc.subject | Traveling salesman problem | en |
dc.subject | Low-power design | en |
dc.subject | Machine learning accelerators | en |
dc.title | Exploiting data encoding and reordering for low-power streaming in systolic arrays | en |
dc.type | info:eu-repo/semantics/article | en |
dc.identifier.doi | 10.1016/j.micpro.2023.104938 | |
dc.description.volume | 102 | en |
dc.author.faculty | 007 Πολυτεχνική Σχολή / Faculty of Engineering | |
dc.author.department | Τμήμα Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών / Department of Electrical and Computer Engineering | |
dc.type.uhtype | Article | en |
dc.contributor.orcid | Nicopoulos, Chrysostomos [0000-0001-6389-6068] | |
dc.contributor.orcid | Filippas, Dionysios [0000-0002-4729-3336] | |
dc.contributor.orcid | Dimitrakopoulos, Giorgos [0000-0003-3688-7865] | |
dc.type.subtype | SCIENTIFIC_JOURNAL | en |
dc.gnosis.orcid | 0000-0001-6389-6068 | |
dc.gnosis.orcid | 0000-0002-4729-3336 | |
dc.gnosis.orcid | 0000-0003-3688-7865 | |