Temporal partitioning of data flow graphs for reconfigurable architectures

Authors:
Bouraoui Ouni;Abdellatif Mtibaa
Affiliations:
Laboratory of Electronic and Microelectronic, Faculty of Sciences, University of Monastir, Monastir 5000, Tunisia;Laboratory of Electronic and Microelectronic, Faculty of Sciences, University of Monastir, Monastir 5000, Tunisia
Venue:
International Journal of Computational Science and Engineering
Year:
2014

Citing 12
Cited 0

Spectral partitioning: the more eigenvectors, the better

DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Scheduling designs into a time-multiplexed FPGA

FPGA '98 Proceedings of the 1998 ACM/SIGDA sixth international symposium on Field programmable gate arrays
Network flow based circuit partitioning for time-multiplexed FPGAs

Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Integrated Block-Processing and Design-Space Exploration in Temporal Partitioning for RTR Architectures

Proceedings of the 11 IPPS/SPDP'99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing
An efficient list scheduling algorithm for time placement problem

Computers and Electrical Engineering
Temporal partitioning data flow graphs for dynamically reconfigurable computing

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Eigenvalue Bounds, Spectral Partitioning, and Metrical Deformations via Flows

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Introduction to Reconfigurable Computing: Architectures, Algorithms, and Applications

Introduction to Reconfigurable Computing: Architectures, Algorithms, and Applications
On combining temporal partitioning and sharing of functional units in compilation for reconfigurable architectures

IEEE Transactions on Computers
Network-flow-based multiway partitioning with area and pin constraints

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Generic ILP-based approaches for time-multiplexed FPGA partitioning

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A partitioning methodology that optimizes the communication cost for reconfigurable computing systems

International Journal of Automation and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present the famous temporal partitioning algorithms that temporally partition a data flow graph on reconfigurable systems. We have classified these algorithms into four classes: 1 whole latency optimisation algorithms; 2 whole communication cost optimisation algorithms; 3 whole area optimisation algorithms; 4 whole latency-communication cost optimisation algorithms. These algorithms can be used to solve the temporal partitioning problem at the behaviour level.