VLSI array processors
A datapath synthesis system for the reconfigurable datapath architecture
ASP-DAC '95 Proceedings of the 1995 Asia and South Pacific Design Automation Conference
FFTs on mesh connected computers
Parallel Computing
Parallel computation: models and methods
Parallel computation: models and methods
Term rewriting and all that
Lava: hardware design in Haskell
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
CACHET: an adaptive cache coherence protocol for distributed shared-memory systems
ICS '99 Proceedings of the 13th international conference on Supercomputing
KressArray Xplorer: a new CAD environment to optimize reconfigurable datapath array
ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
Coarse grain reconfigurable architecture (embedded tutorial)
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Introduction to algorithms
Computer Algorithms: Introduction to Design and Analysis
Computer Algorithms: Introduction to Design and Analysis
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
ELAN from a rewriting logic point of view
Theoretical Computer Science - Rewriting logic and its applications
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Logical foundations of cafeOBJ
Theoretical Computer Science - Rewriting logic and its applications
A Tutorial on Using PVS for Hardware Verification
TPCD '94 Proceedings of the Second International Conference on Theorem Provers in Circuit Design - Theory, Practice and Experience
Mechanizing Verification of Arithmetic Circuits: SRT Division
Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
Hardware Synthesis from Term Rewriting Systems
VLSI '99 Proceedings of the IFIP TC10/WG10.5 Tenth International Conference on Very Large Scale Integration: Systems on a Chip
Rewriting Logic and Maude: Concepts and Applications
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Vectorization of the Radix r Self-Sorting FFT
CONPAR 94 - VAPP VI Proceedings of the Third Joint International Conference on Vector and Parallel Processing: Parallel Processing
MEMOCODE '03 Proceedings of the First ACM and IEEE International Conference on Formal Methods and Models for Co-Design
Modeling a Reconfigurable System for Computing the FFT in Place via Rewriting-Logic
SBCCI '03 Proceedings of the 16th symposium on Integrated circuits and systems design
Configware and morphware going mainstream
Journal of Systems Architecture: the EUROMICRO Journal - Special issue: Reconfigurable systems
Journal of Functional Programming
The digital divide of computing
Proceedings of the 1st conference on Computing frontiers
SBCCI '04 Proceedings of the 17th symposium on Integrated circuits and system design
Operating Systems for Reconfigurable Embedded Platforms: Online Scheduling of Real-Time Tasks
IEEE Transactions on Computers
Computer
Guidelines for a graduate curriculum on embedded software and systems
ACM Transactions on Embedded Computing Systems (TECS)
SAEPTUM: verification of ELAN hardware specifications using the proof assistant PVS
SBCCI '06 Proceedings of the 19th annual symposium on Integrated circuits and systems design
Synthesizing synchronous elastic flow networks
Proceedings of the conference on Design, automation and test in Europe
A PVS Theory for Term Rewriting Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A Formalization of the Knuth---Bendix(---Huet) Critical Pair Theorem
Journal of Automated Reasoning
Hi-index | 0.00 |
Many algebraic operations can be efficiently implemented as pipe networks in arrays of functional units such as systolic arrays that provide a large amount of parallelism. However, the applicability of classical systolic arrays is restricted to problems with strictly regular data dependencies yielding only arrays with uniform linear pipes. This limitation can be circumvented by using reconfigurable systolic arrays or reconfigurable data path arrays, where the node interconnections and operations can be redefined even at run time. In this context, several alternative reconfigurable systolic architectures can be explored and powerful tools are needed to model and evaluate them. Well-known rewriting-logic environments such as ELAN and Maude can be used to specify and simulate complex application-specific integrated systems. In this article we propose a methodology based on rewriting-logic which is adequate to quickly model and evaluate reconfigurable architectures (RA) in general and, in particular, reconfigurable systolic architectures. As an interesting case study we apply this rewriting-logic modeling methodology to the space-efficient treatment of the Fast-Fourier Transform (FFT). The FFT prototype conceived in this way, has been specified and validated in VHDL using the Quartus II system.