skip to main content
10.1145/1016568.1016634acmconferencesArticle/Chapter ViewAbstractPublication PagessbcciConference Proceedingsconference-collections
Article

Modeling and prototyping dynamically reconfigurable systems for efficient computation of dynamic programming methods by rewriting-logic

Published: 04 September 2004 Publication History

Abstract

Systolic arrays provide a large amount of parallelism. However, their applicability is restricted to a small set of computational problems due to their lack of flexibility. This limitation can be circumvented by using reconfigurable systolic arrays, where the node interconnections and operations can be redefined even at run time. In this context, several alternative systolic architectures can be explored and powerful tools are needed to model and evaluate them. We show how well-known rewriting-logic environments could be used to quickly model and simulate complex application specific digital systems speeding-up its subsequent prototyping. We show how to use rewriting-logic to model and evaluate reconfigurable systolic architectures which are applied to the efficient treatment of several dynamic programming methods for resolving well-known problems such as global and local sequence alignment (Smith-Waterman algorithm), approximate string matching and computation of the longest common subsequence. A VHDL description of the conceived architecture was implemented from the rewriting-logic based abstract models and synthesized over an FPGA of the APEX family.

References

[1]
Altera Corporation. Quartus II User Guide. Available at http://www.altera.com. Acessed in 2004.
[2]
Arvind and X. Shen, Using Term Rewriting Systems to Design and Verify Processors, IEEE Micro 19(3):36--46, 1999.
[3]
M. Ayala-Rincon, R. M. Neto, R.P. Jacobi, C. H. Llanos and R. W. Hartenstein, Applying ELAN Strategies in Simulating Processors over Simple Architectures. Elsevier ENTCS 70(6):20 pages, 2002.
[4]
M. Ayala-Rincon, R. B. Nogueira, R.P. Jacobi, C. H. Llanos and R. W. Hartenstein, Modeling a Reconfigurable System for Computing the FFT in Place via Rewriting-Logic. in Proc. SBCCI'03, pages 205--210, 2003.
[5]
F. Baader and T. Nipkow, Term Rewriting and all That, Cambridge University Press, 1998.
[6]
J. Becker and R. W. Hartenstein, Configware and morphware going mainstream, J. of Systems Architecture 49:127--142, 2003.
[7]
P. Borovansky, C. Kirchner, H. Kirchner and P.-E. Moreau, ELAN from a rewriting logic point of view, pgs. 155--185 of {20}.
[8]
M. Clavel, F. Duran, S. Eker, P. Lincoln, N. Marti-Oliet, J. Meseguer and J. F. Quesada, Maude: specification and programming in rewriting logic, pages 187--243 of {20}.
[9]
K. Claessen, P. Bjesse, M. Sheeran and S. Singh, Lava: Hardware Design in Haskell, Proc. ICFP, pages 174--184, 1998.
[10]
R. Diaconescu and K. Futatsugi, Logical foundations of CafeOBJ, pages 289--318 of {20}.
[11]
D. Gusfield, Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, CUP, 1997.
[12]
R. Hartenstein, R. Kress and H. Reinig. A Scalable, Parallel and Reconfigurable Datapath Architecture. 6th Int. Sym. on IC Technology, Systems and Applications - ISIC'95, Singapore, 1995.
[13]
R. Hartenstein, M. Herz, T. Hoffmann, U. Nageldinger. Kress Array Explorer: A New CAD Environment to Optimize Reconfigurable Datapath Array Architectures. 5th Asia and South Pacific Design Automation Conf. - ASP-DAC 2000, Japan, 2000.
[14]
J.C. Hoe and Arvind, Hardware Synthesis from Term Rewriting Systems, in Proc. of the 10th IFIP Int. Conf. on VLSI, pages 595--619, 1999.
[15]
D. Kapur and M. Subramaniam, Mechanizing Verification of Arithmetic Circuits: SRT Division. In Proc. 7th FSTTCS, LNCS, Vol. 1346, pages 103--122, Springer-Verlag, 1997.
[16]
D. Kapur and M. Subramaniam. Using and Induction Prover for Verifying Arithmetic Circuits. Journal of Software Tools for Technology Transfer, 3(1):32--65, Springer Verlag, 2000.
[17]
H.T. Kung, C. E. Leiserson, Systolic Arrays for VLSI; Sparse Matrix Proc., Soc. for Industrial and App. Math., 256--282, 1979.
[18]
S. Y. Kung. VLSI Array Processors. Prentice-Hall, 1987.
[19]
R.J. Lipton, D. Lopresti: A systolic array for rapid string comparison. In: Chapel Hill Conference on VLSI. (1985) 363--376
[20]
N. Marti-Oliet and J. Meseguer, eds., Special issue on Rewriting Logic and its Applications, TCS 285(2): 119-564, 2002.
[21]
R. C. F. Melo, M. E. T. Walter, A. C. M. A. Melo, R. Batista, M. Nardelli, M. Martins and T. Fonseca, Comparing Two Long Biological Sequences Using a DSM System. Proc. Euro-Par 2003 - Parallel Processing, LNCS, Vol. 2790, pages 517--524, 2003.
[22]
J. Messeguer, Executable Computational Logics: Combining Formal Methods and Programming Language Based System Design, Proc. First Int. Conf. on Formal Methods and Models for Co-design, IEEE CS, 2003.
[23]
U. Nageldinger: Coarse-grained Reconfigurable Architecture Design Space Exploration, PhD Thesis, TU Kaiserslautern, 2001
[24]
T. F. Smith and M.S. Waterman, Identification of Common Molecular Subsequences. J. of Mol. Biology, 147:195--197, 1981.
[25]
Yamaguchi, T. Maruyama, A. Konagaya, High speed homology search with FPGAs. Pacific Symposium on Biocomputing (2002) 271--282.
[26]
C.W. Yu, K.H. Kwong, K.H. Lee and P.H.W. Leong, A Smith-Waterman Systolic Cell, FPL'03, Springer LNCS 2778:375--384, 2003.

Cited By

View all
  • (2007)Using Rewriting Logic to Match Patterns of Instructions from a Compiler Intermediate Form to Coarse-Grained Processing Elements2007 IEEE International Parallel and Distributed Processing Symposium10.1109/IPDPS.2007.370369(1-8)Online publication date: Mar-2007
  • (2006)Prototyping time- and space-efficient computations of algebraic operations over dynamically reconfigurable systems modeled by rewriting-logicACM Transactions on Design Automation of Electronic Systems10.1145/1142155.114215611:2(251-281)Online publication date: 1-Apr-2006
  • (2006)From Equation to VHDL: Using Rewriting Logic for Automated Function Generation2006 International Conference on Field Programmable Logic and Applications10.1109/FPL.2006.311289(1-4)Online publication date: Aug-2006
  • Show More Cited By

Index Terms

  1. Modeling and prototyping dynamically reconfigurable systems for efficient computation of dynamic programming methods by rewriting-logic

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      SBCCI '04: Proceedings of the 17th symposium on Integrated circuits and system design
      September 2004
      296 pages
      ISBN:1581139470
      DOI:10.1145/1016568
      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]

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 04 September 2004

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. configware
      2. dynamic programming
      3. morphware
      4. reconfigurable systolic arrays
      5. rewriting-logic
      6. term rewriting systems (TRS)

      Qualifiers

      • Article

      Conference

      SBCCI04
      Sponsor:

      Acceptance Rates

      Overall Acceptance Rate 133 of 347 submissions, 38%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 14 Feb 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2007)Using Rewriting Logic to Match Patterns of Instructions from a Compiler Intermediate Form to Coarse-Grained Processing Elements2007 IEEE International Parallel and Distributed Processing Symposium10.1109/IPDPS.2007.370369(1-8)Online publication date: Mar-2007
      • (2006)Prototyping time- and space-efficient computations of algebraic operations over dynamically reconfigurable systems modeled by rewriting-logicACM Transactions on Design Automation of Electronic Systems10.1145/1142155.114215611:2(251-281)Online publication date: 1-Apr-2006
      • (2006)From Equation to VHDL: Using Rewriting Logic for Automated Function Generation2006 International Conference on Field Programmable Logic and Applications10.1109/FPL.2006.311289(1-4)Online publication date: Aug-2006
      • (2005)Felix: using rewriting-logic for generating functionally equivalent implementationsInternational Conference on Field Programmable Logic and Applications, 2005.10.1109/FPL.2005.1515694(25-30)Online publication date: 2005

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media