Greg Stitt
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Greg Stitt has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Ann Gordon-Ross
Department of Electrical and Computer Engineering, Univeristy of Florida, Gainesville, USA
1 shared publication - Ayobami S. Edun
Department of Electrical and Computer Engineering, University of Florida, Gainesville, FL, USA
1 shared publication - David Wilson
University of Florida, Gainesville, FL, USA
1 shared publication - John R. Wernsing
Department of Electrical & Computer Engineering, University of Florida, Gainesville, FL, United States
1 shared publication - Ruben Vazquez
Department of Electrical and Computer Engineering, Univeristy of Florida, Gainesville, USA
1 shared publication
Latest Publications
- 18 October 2021
- Published by Springer Nature in SN Computer Science
- Vol. 2 (6) , 1-16
Dynamic Scheduling for Heterogeneous Multicores
- 18 October 2021
- Published by Springer Nature in SN Computer Science
- Vol. 2 (6) , 1-16
Dynamic Scheduling for Heterogeneous Multicores
- Open Access
A Scalable, Low-Overhead Finite-State Machine Overlay for Rapid FPGA Application Development
Productivity issues such as lengthy compilation and limited code reuse have restricted usage of field-programmable gate arrays (FPGAs), despite significant technical advantages. Recent work into overlays -- virtual coarse-grained architectures implemented atop FPGAs -- has aimed to address these concerns through abstraction, but have mostly focused on pipelined applications with minimal control requirements. Although research has introduced overlays for finite-state machines, those architectures suffer from limited scalability and flexibility, which we address with a new overlay architecture using memory decomposition on transitional logic. Although our overlay provides modest average improvements of 15% to 29% fewer lookup tables for individual finite-state machines, for the more common usage of an overlay supporting different finite-state machines, our overlay achieves a 77% to 99% reduction in lookup tables. In addition, our overlay reduces compilation time to tenths of a second to enable rapid iterative-development methodologies.
Open AccessA Scalable, Low-Overhead Finite-State Machine Overlay for Rapid FPGA Application Development
Productivity issues such as lengthy compilation and limited code reuse have restricted usage of field-programmable gate arrays (FPGAs), despite significant technical advantages. Recent work into overlays -- virtual coarse-grained architectures implemented atop FPGAs -- has aimed to address these concerns through abstraction, but have mostly focused on pipelined applications with minimal control requirements. Although research has introduced overlays for finite-state machines, those architectures suffer from limited scalability and flexibility, which we address with a new overlay architecture using memory decomposition on transitional logic. Although our overlay provides modest average improvements of 15% to 29% fewer lookup tables for individual finite-state machines, for the more common usage of an overlay supporting different finite-state machines, our overlay achieves a 77% to 99% reduction in lookup tables. In addition, our overlay reduces compilation time to tenths of a second to enable rapid iterative-development methodologies.
- 16 May 2012
- Published by Elsevier in Parallel Computing
- Vol. 38 (8) , 438-464
Elastic computing: A portable optimization framework for hybrid computers
- 16 May 2012
- Published by Elsevier in Parallel Computing
- Vol. 38 (8) , 438-464
Elastic computing: A portable optimization framework for hybrid computers