Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > Fast placement and routing by extending coarse-grained reconfigurable arrays with Omega Networks
Publication

Publications

Fast placement and routing by extending coarse-grained reconfigurable arrays with Omega Networks

Title
Fast placement and routing by extending coarse-grained reconfigurable arrays with Omega Networks
Type
Article in International Scientific Journal
Year
2011
Authors
Ferreira, RS
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Damiany, A
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Vendramini, J
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Teixeira, T
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Journal
Vol. 57
Pages: 761-777
ISSN: 1383-7621
Publisher: Elsevier
Other information
Authenticus ID: P-002-MXT
Abstract (EN): Reconfigurable computing architectures are commonly used for accelerating applications and/or for achieving energy savings. However, most reconfigurable computing architectures suffer from computationally demanding placement and routing (P&R) steps. This problem may disable their use in systems requiring dynamic compilation (e.g., to guarantee application portability in embedded systems). Bearing in mind the simplification of P&R steps, this paper presents and analyzes a coarse-grained reconfigurable array (CGRA) extended with global multistage interconnect networks, specifically Omega Networks. We show that integrating one or two Omega Networks in a CGRA permits to simplify the P&R stage resulting in both low hardware resource overhead and low performance degradation (18% for an 8 x 8 array). We compare the proposed CGRA, which integrates one or two Omega Networks, with a CGRA based on a grid of processing elements with reach neighbor interconnections and with a torus topology. The execution time needed to perform the P&R stage for the two array architectures shows that the array using two Omega Networks needs a far simpler and faster P&R. The P&R stage in our approach completed on average in about 16 x less time for the 17 benchmarks used. Similar fast approaches needed CGRAs with more complex interconnect resources in order to allow most of the benchmarks used to be successfully placed and routed.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 17
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same journal

Special issue on design of algorithms and architectures for signal and image processing (2017)
Another Publication in an International Scientific Journal
Gorgon, M; João M. P. Cardoso; Gohringer, D; Indrusiak, LS
Introduction to the special issue on architecture of computing systems (2017)
Another Publication in an International Scientific Journal
Hannig, F; João M. P. Cardoso; Fey, D
Support for partial run-time reconfiguration of platform FPGAs (2006)
Article in International Scientific Journal
Miguel Lino Magalhães da Silva; João Paulo de Castro Canas Ferreira
Scalable Hardware Architecture for Disparity Map Computation and Object Location in Real-Time (2013)
Article in International Scientific Journal
Pedro Santos; João Canas Ferreira; José Silva Matos
Run-time generation of partial FPGA configurations (2012)
Article in International Scientific Journal
Miguel L. Silva; João Canas Ferreira

See all (12)

Recommend this page Top
Copyright 1996-2025 © Faculdade de Direito da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-07-27 at 01:15:40 | Privacy Policy | Personal Data Protection Policy | Whistleblowing