Publicacoes - INESC TEC

Publicações

Publicações por HumanISE

2002

1st Ibero-American Symposium in Computer Graphics

Autores
Marcos, A; Brunet, P; Jorge, J; Regincos, J;

Publicação
Computer Graphics Forum

Abstract

2001

How the FEUP Removal to the New Premises Was Facilitated by the Internal Information System

Autores
Ribeiro, LM; Carravilla, MA; David, G;

Publicação
The Changing Universities - The Role of Technology, The 7th International Conference of European University Information Systems, March 28-30, 2001, Berlin, Germany, Proceedings

Abstract
[No abstract available]

FecharLer Abstract

2001

A Metadata Model for Multimedia Databases

Autores
Ribeiro, C; David, G;

Publicação
ICHIM (1)

Abstract

2001

Movement Query Operations for Spatio-Temporal Databases

Autores
Abdessalem, T; Moreira, J; Ribeiro, C;

Publicação
17èmes Journées Bases de Données Avancées, BDA 2001, 29 octobre - 2 novembre, Agadir (Maroc), Actes (Informal Proceedings).

Abstract

2001

Use-Case Controller

Autores
Aguiar, A; Sousa, A; Pinto, A;

Publicação
Proceedings of the 6th European Conference on Pattern Languages of Programms (EuroPLoP '2001), Irsee, Germany, July 4-8, 2001.

Abstract

2001

Novel Algorithm Combining Temporal Partitioning and Sharing of Functional Units

Autores
Cardoso, JMP;

Publicação
Proceedings - 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM 2001

Abstract
Resource virtualization on FPGA devices, achievable due to its dynamic reconfiguration capabilities, provides an attractive solution to save silicon area. Architectural synthesis for dynamically reconfigurable FPGA-based digital systems needs to consider the case of reducing the number of temporal partitions (reconfigurations), by enabling sharing of some functional units in the same temporal partition. This paper proposes a novel algorithm for automated datapath design, from behavioral input descriptions (represented by a dataflow graph), which simultaneously performs temporal partitioning and sharing of functional units. The proposed algorithm attempts to minimize both the number of temporal partitions and the execution latency of the generated solution. Temporal partitioning, resource sharing, scheduling, and a simple form of allocation and binding are all integrated in a single task. The algorithm is based on heuristics and on a new concept of construction by gradually enlarging timing slots. Results show the efficiency and effectiveness of the algorithm when compared to existent approaches. © 2001 Non IEEE.

FecharLer Abstract