Gregory B. Newby
Gregory B. Newby has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Tarek El-Ghazawi
The George Washington University, Washington, D.C., USA
3 shared publications - Abdullah Kayi
The George Washington University, Dept. of Electrical and Computer Engineering, Washington, DC 20052, USA
1 shared publication - Esam El-Araby
Department of Electrical Engineering and Computer Science, University of Kansas, Lawrence, KS 66045, USA
1 shared publication - Miaoqing Huang
Department of Computer Science and Computer Engineering, University of Arkansas, Fayetteville, AR 72701, USA
1 shared publication - Mohamed Abouellail
The George Washington Univeristy
1 shared publication - Mohamed Taher
Department of Computer and Systems Engineering, Faculty of Engineering, Ain Shams University, Cairo 11517, Egypt
1 shared publication
Latest Publications
- 1 October 2009
- Published by Elsevier in Simulation Modelling Practice and Theory
- Vol. 17 (9) , 1485-1499
Performance issues in emerging homogeneous multi-core architectures
- 1 October 2009
- Published by Elsevier in Simulation Modelling Practice and Theory
- Vol. 17 (9) , 1485-1499
Performance issues in emerging homogeneous multi-core architectures
- 1 March 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 257-260
An Image Processing Architecture to Exploit I/O Bandwidth on Reconfigurable Computers
FPGA devices in reconfigurable computers (RCs) allow datapath, memory, and processing elements (PEs) to be customized in order to achieve very efficient algorithm implementations. However, the maximum speedup on RCs is bounded by the bandwidth available between muPs and FPGA hardware accelerators. In this paper, an image processing architecture is presented to fully exploit this bandwidth for achieving the maximum possible speedup. This architecture can be used to implement any convolution operation between an image and a kernel, and comprises four fully pipelined components: a line buffer, a data window, an array of PEs and a data concatenating block. Multiple image processing algorithms have been successfully implemented using this architecture, such as digital filters, edge detectors, and image transforms. In all cases, the maximum throughput is upper-bounded by the muP-FPGA I/O bandwidth, regardless of the complexity of the algorithm. This end-to-end throughput has been measured to be 1.2 GB/s on Cray XD1 and 2.1 GB/s on SGI RC100.
- 1 March 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 257-260
An Image Processing Architecture to Exploit I/O Bandwidth on Reconfigurable Computers
FPGA devices in reconfigurable computers (RCs) allow datapath, memory, and processing elements (PEs) to be customized in order to achieve very efficient algorithm implementations. However, the maximum speedup on RCs is bounded by the bandwidth available between muPs and FPGA hardware accelerators. In this paper, an image processing architecture is presented to fully exploit this bandwidth for achieving the maximum possible speedup. This architecture can be used to implement any convolution operation between an image and a kernel, and comprises four fully pipelined components: a line buffer, a data window, an array of PEs and a data concatenating block. Multiple image processing algorithms have been successfully implemented using this architecture, such as digital filters, edge detectors, and image transforms. In all cases, the maximum throughput is upper-bounded by the muP-FPGA I/O bandwidth, regardless of the complexity of the algorithm. This end-to-end throughput has been measured to be 1.2 GB/s on Cray XD1 and 2.1 GB/s on SGI RC100.
- 1 February 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 99-106
Comparative Analysis of High Level Programming for Reconfigurable Computers: Methodology and Empirical Study
Most application developers are willing to give up some performance and chip utilization in exchange of productivity. High-level tools for developing reconfigurable computing applications trade performance with ease-of-use. However, it is hard to know in a general sense how much performance and utilization one is giving up and how much ease-of-use he/she is gaining. More importantly, given the lack of standards and the uncertainty generated by sales literature, it is very hard to know the real differences that exist among different high-level programming paradigms. In order to do so, one needs a formal methodology and/or a framework that uses a common set of metrics and common experiments over a number of representative tools. In this work, we consider three representative high-level tools, Impulse-C, Mitrion-C, and DSPLogic in the Cray XD1 environment. These tools were selected to represent imperative programming, functional programming and graphical programming, and thereby demonstrate the applicability of our methodology. It will be shown that in spite of the disparity in concepts behind those tools, our methodology will be able to formally uncover the basic differences among them and analytically assess their comparative performance, utilization, and ease-of-use.
- 1 February 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 99-106
Comparative Analysis of High Level Programming for Reconfigurable Computers: Methodology and Empirical Study
Most application developers are willing to give up some performance and chip utilization in exchange of productivity. High-level tools for developing reconfigurable computing applications trade performance with ease-of-use. However, it is hard to know in a general sense how much performance and utilization one is giving up and how much ease-of-use he/she is gaining. More importantly, given the lack of standards and the uncertainty generated by sales literature, it is very hard to know the real differences that exist among different high-level programming paradigms. In order to do so, one needs a formal methodology and/or a framework that uses a common set of metrics and common experiments over a number of representative tools. In this work, we consider three representative high-level tools, Impulse-C, Mitrion-C, and DSPLogic in the Cray XD1 environment. These tools were selected to represent imperative programming, functional programming and graphical programming, and thereby demonstrate the applicability of our methodology. It will be shown that in spite of the disparity in concepts behind those tools, our methodology will be able to formally uncover the basic differences among them and analytically assess their comparative performance, utilization, and ease-of-use.