Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > A polynomial placement algorithm for data driven coarse-grained reconfigurable architectures
Publication

A polynomial placement algorithm for data driven coarse-grained reconfigurable architectures

Title
A polynomial placement algorithm for data driven coarse-grained reconfigurable architectures
Type
Article in International Conference Proceedings Book
Year
2007
Authors
Ricardo Ferreira
(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
Alisson Garcia
(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
Tiago Teixeira
(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
Conference proceedings International
Pages: 61-66
IEEE-Computer-Society Annual Symposium on VLSI
Porto Alegre, BRAZIL, MAR 08-11, 2007
Indexing
Scientific classification
FOS: Engineering and technology > Electrical engineering, Electronic engineering, Information engineering
CORDIS: Technological sciences > Engineering > Computer engineering
Other information
Authenticus ID: P-007-JVC
Abstract (EN): Coarse-grained reconfigurable computing architectures vary widely in the number and characteristics of the processing elements (cells) and routing topologies used. In order to exploit several different topologies, a place and route framework, able to deal with such vast design exploration space, is of paramount importance. Bearing this in mind, this paper proposes a placement scheme able to target different topologies when considering data-driven reconfigurable architectures. Our approach uses graph models for the target architecture and for the dataflow representation of the application being mapped. Our placement algorithm is guided by a Depth-First Traversal in both the architecture and the application graphs. Two versions of the placement algorithm with respectively O(e) and O(e + n(3)) computational complexities are presented, where e is the number of edges in the dataflow representation of the application and n is the number of cells in the graph model of the architecture. The achieved experimental results show that our approach can be useful to exploit different interconnect topologies as far as coarse-grained reconfigurable computing architectures are concerned.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 6
Documents
We could not find any documents associated to the publication with allowed access.
Recommend this page Top
Copyright 1996-2024 © Reitoria da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z  I Guest Book
Page created on: 2024-09-19 16:12:47 | Acceptable Use Policy | Data Protection Policy | Complaint Portal