Share Email Print

Proceedings Paper

Combined temporal partitioning and scheduling for reconfigurable architectures
Author(s): Awartika Pandey; Ranga Vemuri
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Dynamically Reconfigurable processors are becoming increasingly viable with the advent of modern field- programmable devices. A key feature of dynamically reconfigurable FPGAs is that the logic, and interconnect is time-multiplexed. This enables the implementation of large circuits by partitioning the specification into multiple segments, that execute one after the other on the reconfigurable processor. The available resources can be reused which gives us virtually an infinite pool of resources. In this paper, we introduce a novel technique of temporal partitioning and synthesis of behavioral specification for reconfigurable architectures. We try to optimize the overall latency by performing a trade-off between the total number of partitioned segments, and the latency of each segment. Our approach integrates partitioning and scheduling, and performs design exploration to exploit the trade-off. We also introduce an enhanced Force-Directed List Scheduling algorithm to perform partitioning. We demonstrate the effectiveness of our approach with experimental results.

Paper Details

Date Published: 26 August 1999
PDF: 11 pages
Proc. SPIE 3844, Reconfigurable Technology: FPGAs for Computing and Applications, (26 August 1999); doi: 10.1117/12.359528
Show Author Affiliations
Awartika Pandey, Univ. of Cincinnati (United States)
Ranga Vemuri, Univ. of Cincinnati (United States)

Published in SPIE Proceedings Vol. 3844:
Reconfigurable Technology: FPGAs for Computing and Applications
John Schewel; Peter M. Athanas; Steven A. Guccione; Stefan Ludwig; John T. McHenry, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?