Abstract
In this paper we investigate the datapath merging problem (DPM) in reconfigurable systems. DPM is in \(\mathcal{NP}\)-hard and it is described here in terms of a graph optimization problem. We present an Integer Programming (IP) formulation of DPM and introduce some valid inequalities for the convex hull of integer solutions. These inequalities form the basis of a branch-and-cut algorithm that we implemented. This algorithm was used to compute lower bounds for a set of DPM instances, allowing us to assess the performance of the heuristic proposed by Moreano et al. [1] which is among the best ones available for the problem. Our computational experiments confirmed the efficiency of Moreano’s heuristic. Moreover, the branch-and-cut algorithm also was proved to be a valuable tool to solve small-sized DPM instances to optimality.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Moreano, N., Araujo, G., Huang, Z., Malik, S.: Datapath merging and interconnection sharing for reconfigurable architectures. In: Proceedings of the 15th International Symposium on System Synthesis, pp. 38–43 (2002)
Wolf, W.: Computers as Components – Principles of Embedded Computing System Design. Morgan Kaufmann Publishers, San Francisco (2001)
DeHon, A., Wawrzynek, J.: Reconfigurable computing: What, why, and implications for design automation. In: Proceedings of the Design Automation Conference (DAC), pp. 610–615 (1999)
Schaumont, P., Verbauwhede, I., Keutzer, K., Sarrafzadeh, M.: A quick safari through the reconfiguration jungle. In: Proceedings of the Design Automation Conference (DAC), pp. 172–177 (2001)
Compton, K., Hauck, S.: Reconfigurable computing: A survey of systems and software. ACM Computing Surveys 34, 171–210 (2002)
Bondalapati, K., Prasanna, V.: Reconfigurable computing systems. Proceedings of the IEEE (2002)
Callahan, T., Hauser, J., Wawrzynek, J.: The Garp architecture and C compiler. IEEE Computer, 62–69 (2000)
Singh, H., Lee, M., Lu, G., Kurdahi, F., Bagherzadeh, N., Filho, E.: MorphoSys: An integrated reconfigurable system for data-parallel and computation-intensive applications. IEEE Transactions on Computers 49, 465–481 (2000)
Schmit, H., et al.: PipeRench: A virtualized programmable datapath in 0.18 micron technology. In: Proceedings of the IEEE Custom Integrated Circuits Conference (CICC), pp. 63–66 (2002)
Moreano, N., Araujo, G., de Souza, C.C.: CDFG merging for reconfigurable architectures. Technical Report IC-03-18, Institute of Computing, University of Campinas SP, Brazil (2003)
Nemhauser, G.L., Wolsey, L.: Integer and Combinatorial Optimization. Wiley & Sons, Chichester (1988)
Grötschel, M., Lovász, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169–197 (1981)
MediaBench benchmark, http://cares.icsl.ucla.edu/MediaBench/
Battiti, R., Protasi, M.: Reactive local search for the maximum clique problem. Algorithmica 29, 610–637 (2001)
Clique code, http://rtm.science.unitn.it/intertools/clique/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Souza, C.C., Lima, A.M., Moreano, N., Araujo, G. (2004). The Datapath Merging Problem in Reconfigurable Systems: Lower Bounds and Heuristic Evaluation. In: Ribeiro, C.C., Martins, S.L. (eds) Experimental and Efficient Algorithms. WEA 2004. Lecture Notes in Computer Science, vol 3059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24838-5_40
Download citation
DOI: https://doi.org/10.1007/978-3-540-24838-5_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22067-1
Online ISBN: 978-3-540-24838-5
eBook Packages: Springer Book Archive