article

The datapath merging problem in reconfigurable systems: Complexity, dual bounds and heuristic evaluation

Authors:

Cid C. de Souza,

Nahri B. MoreanoAuthors Info & Claims

Journal of Experimental Algorithmics (JEA), Volume 10

Pages 2.2 - es

https://doi.org/10.1145/1064546.1180613

Published: 31 December 2005 Publication History

Abstract

In this paper, we investigate the data path merging problem (DPM) in reconfigurable systems. DPM is modeled as a graph optimization problem and is shown to be NP-hard. An Integer Programming (IP) formulation of the problem is presented and some valid inequalities for the convex hull of integer solutions are introduced. 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 two heuristics proposed earlier in the literature for the problem. Moreover, the branch-and-cut algorithm also was proved to be a valuable tool to solve small-sized DPM instances to optimality.

References

[1]

Battiti, R. and Protasi, M. 2001. Reactive local search for the maximum clique problem. Algorithmica 29, 4 (April), 610--637. C++ code available at http://rtm.science.unitn.it/intertools/clique/.

Digital Library

[2]

Bondalapati, K. and Prasanna, V. 2002. Reconfigurable computing systems. Proceedings of the IEEE 90, 7 (July), 1201--1217.

[3]

Brisk, P., Kaplan, A., and Sarrafzadeh, M. 2004. Area-efficient instruction set synthesis for reconfigurable system-on-chip designs. In Proceedings of the Design Automation Conference (DAC). 395--400.

Digital Library

[4]

Callahan, T., Hauser, J., and Wawrzynek, J. 2000. The Garp architecture and C compiler. IEEE Computer 33, 4 (April), 62--69.

Digital Library

[5]

Compton, K. and Hauck, S. 2002. Reconfigurable computing: A survey of systems and software. ACM Computing Surveys 34, 2 (June), 171--210.

Digital Library

[6]

DeHon, A. and Wawrzynek, J. 1999. Reconfigurable computing: What, why, and implications for design automation. In Proceedings of the Design Automation Conference (DAC). 610--615.

Digital Library

[7]

Garey, M. and Johnson, D. S. 1979. Computers and Intractability---A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA.

Digital Library

[8]

Geurts, W., Catthoor, F., Vernalde, S., and De Man, H. 1997. Accelerator Data-path Synthesis for High-Throughput Signal Processing Applications. Kluwer Academic Publishers. Boston, MA.

Digital Library

[9]

Grötschel, M., Lovász, L., and Schrijver, A. 1981. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169--197.

[10]

Huang, Z. and Malik, S. 2001. Managing dynamic reconfiguration overhead in systems-on-a-chip design using reconfigurable data paths and optimized interconnection networks. In Proceedings of the Design, Automation, and Test in Europe Conference (DATE). 735--740.

Digital Library

[11]

Lee, C., Potkonjak, M., and Mangione-Smith, W. 1997. Mediabench: a tool for evaluating and synthesizing multimedia and communications systems. In Proceedings of the 30th Annual International Symposium on Microarchitecture (Micro '97). IEEE, Research Triangle Park, NC. 330--337. Benchmarks available at http://cares.icsl.ucla.edu/MediaBench/.

Digital Library

[12]

Mathur, A. and Saluja, S. 2001. Improved merging of data path operators using information content and required precision analysis. In Proceedings of the Design Automation Conference (DAC). 462--467.

Digital Library

[13]

Moreano, N., Araujo, G., Huang, Z., and Malik, S. 2002. Datapath merging and interconnection sharing for reconfigurable architectures. In Proceedings of the 15th International Symposium on System Synthesis. 38--43.

Digital Library

[14]

Moreano, N., Araujo, G., and de Souza, C. C. 2003. CDFG merging for reconfigurable architectures. Tech. Rep. IC-03-18, Institute of Computing, University of Campinas SP, Brazil.

[15]

Nemhauser, G. L. and Wolsey, L. 1988. Integer and Combinatorial Optimization. Wiley, New York.

Digital Library

[16]

Papadimitriou, C. H. and Steiglitz, K. 1998. Combinatorial Optimization: Algorithms and Complexity. Mineola, NY: Dover Publications.

Digital Library

[17]

Schaumont, P., Verbauwhede, I., Keutzer, K., and Sarrafzadeh, M. 2001. A quick safari through the reconfiguration jungle. In Proceedings of the Design Automation Conference (DAC). 172--177.

Digital Library

[18]

Schmit, H. et al. 2002. PipeRench: A virtualized programmable data path in 0.18 micron technology. In Proceedings of the IEEE Custom Integrated Circuits Conference (CICC). 63--66.

[19]

Shirazi, N., Luk, W., and Cheung, P. 1998. Automating production of run-time reconfigurable designs. In Proceedings of the IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM). 147--156.

Digital Library

[20]

Singh, H., Lee, M., Lu, G., Kurdahi, F., Bagherzadeh, N., and Filho, E. 2000. MorphoSys: An integrated reconfigurable system for data-parallel and computation-intensive applications. IEEE Transactions on Computers 49, 5 (May), 465--481.

Digital Library

[21]

Werf, A. et al. 1992. Area optimization of multi-functional processing units. In Proceedings of the 1992 International Conference on Computer-Aided Design (ICCAD). 292--299.

Digital Library

[22]

Wolf, W. 2001. Computers as Components---Principles of Embedded Computing System Design. Morgan Kaufmann, San Mateo, CA.

Digital Library

Cited By

Tibaldi MPalermo GPilato C(2022)Dynamically-Tunable Dataflow Architectures Based on Markov Queuing ModelsElectronics10.3390/electronics1104055511:4(555)Online publication date: 12-Feb-2022
https://doi.org/10.3390/electronics11040555
Sau CFanni TRubattu CRaffo LPalumbo F(2021)The Multi-Dataflow Composer toolMicroprocessors & Microsystems10.1016/j.micpro.2020.10332680:COnline publication date: 1-Feb-2021
https://dl.acm.org/doi/10.1016/j.micpro.2020.103326
Ng HLiu SLuk WAnderson JBazargan K(2018)ADAMProceedings of the 2018 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays10.1145/3174243.3174247(189-198)Online publication date: 15-Feb-2018
https://dl.acm.org/doi/10.1145/3174243.3174247
Show More Cited By

Index Terms

The datapath merging problem in reconfigurable systems: Complexity, dual bounds and heuristic evaluation

Recommendations

A tabu search algorithm for the quadratic assignment problem

Tabu search approach based algorithms are among the widest applied to various combinatorial optimization problems. In this paper, we propose a new version of the tabu search algorithm for the well-known problem, the quadratic assignment problem (QAP). ...
Branch-and-bound algorithm for the maximum triangle packing problem

We introduce a new branch-and-bound algorithm for the maximum triangle packing problem.The branch-and-bound algorithm uses a lower bound based on neighborhood degree.We present a novel upper bound based on a surrogate relaxation of the related ILP.Our ...
The Multidimensional Knapsack Problem: Structure and Algorithms

We study the multidimensional knapsack problem, present some theoretical and empirical results about its structure, and evaluate different integer linear programming (ILP)-based, metaheuristic, and collaborative approaches for it. We start by ...

Comments

Information & Contributors

Information

Published In

cover image ACM Journal of Experimental Algorithmics

ACM Journal of Experimental Algorithmics Volume 10, Issue

2005

291 pages

ISSN:1084-6654

EISSN:1084-6654

DOI:10.1145/1064546

Issue’s Table of Contents

Copyright © 2005 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 31 December 2005

Published in JEA Volume 10

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
500
Total Downloads

Downloads (Last 12 months)14
Downloads (Last 6 weeks)1

Reflects downloads up to 01 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Tibaldi MPalermo GPilato C(2022)Dynamically-Tunable Dataflow Architectures Based on Markov Queuing ModelsElectronics10.3390/electronics1104055511:4(555)Online publication date: 12-Feb-2022
https://doi.org/10.3390/electronics11040555
Sau CFanni TRubattu CRaffo LPalumbo F(2021)The Multi-Dataflow Composer toolMicroprocessors & Microsystems10.1016/j.micpro.2020.10332680:COnline publication date: 1-Feb-2021
https://dl.acm.org/doi/10.1016/j.micpro.2020.103326
Ng HLiu SLuk WAnderson JBazargan K(2018)ADAMProceedings of the 2018 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays10.1145/3174243.3174247(189-198)Online publication date: 15-Feb-2018
https://dl.acm.org/doi/10.1145/3174243.3174247
Desnos KPalumbo F(2018)Dataflow Modeling for Reconfigurable Signal Processing SystemsHandbook of Signal Processing Systems10.1007/978-3-319-91734-4_22(787-824)Online publication date: 14-Oct-2018
https://doi.org/10.1007/978-3-319-91734-4_22
Gottschling PHochberger C(2017)ReEP: A Toolset for Generation and Programming of Reconfigurable Datapaths for Event Processing2017 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)10.1109/IPDPSW.2017.138(141-149)Online publication date: May-2017
https://doi.org/10.1109/IPDPSW.2017.138
Mishra AAgarwal MAsati ARaju K(2017)Using graph isomorphism for mapping of data flow applications on reconfigurable computing systemsMicroprocessors and Microsystems10.1016/j.micpro.2016.12.00851(343-355)Online publication date: Jun-2017
https://doi.org/10.1016/j.micpro.2016.12.008
Palumbo FFanni TSau CMeloni PRaffo L(2016)Modelling and Automated Implementation of Optimal Power Saving Strategies in Coarse-Grained Reconfigurable ArchitecturesJournal of Electrical and Computer Engineering10.1155/2016/42373502016(5)Online publication date: 1-Nov-2016
https://dl.acm.org/doi/10.1155/2016/4237350
Fanni TSau CMeloni PRaffo LPalumbo FPalermo GFeo JTumeo AFranke H(2016)Power and clock gating modelling in coarse grained reconfigurable systemsProceedings of the ACM International Conference on Computing Frontiers10.1145/2903150.2911713(384-391)Online publication date: 16-May-2016
https://dl.acm.org/doi/10.1145/2903150.2911713
Lin HFei Y(2012)Resource Sharing of Pipelined Custom Hardware Extension for Energy-Efficient Application-Specific Instruction Set Processor DesignACM Transactions on Design Automation of Electronic Systems10.1145/2348839.234884317:4(1-20)Online publication date: 1-Oct-2012
https://dl.acm.org/doi/10.1145/2348839.2348843
York JChiou DGroeneveld PSciuto DHassoun S(2012)On the asymptotic costs of multiplexer-based reconfigurabilityProceedings of the 49th Annual Design Automation Conference10.1145/2228360.2228503(790-795)Online publication date: 3-Jun-2012
https://dl.acm.org/doi/10.1145/2228360.2228503
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents