ACM Home Page
Please provide us with feedback. Feedback
Instruction set extension with shadow registers for configurable processors
Full text PdfPdf (447 KB)
Source International Symposium on Field Programmable Gate Arrays archive
Proceedings of the 2005 ACM/SIGDA 13th international symposium on Field-programmable gate arrays table of contents
Monterey, California, USA
SESSION: Computation techniques for FPGAs table of contents
Pages: 99 - 106  
Year of Publication: 2005
ISBN:1-59593-029-9
Authors
Jason Cong  University of California, Los Angeles, Los Angeles, CA
Yiping Fan  University of California, Los Angeles, Los Angeles, CA
Guoling Han  University of California, Los Angeles, Los Angeles, CA
Ashok Jagannathan  University of California, Los Angeles, Los Angeles, CA
Glenn Reinman  University of California, Los Angeles, Los Angeles, CA
Zhiru Zhang  University of California, Los Angeles, Los Angeles, CA
Sponsors
ACM: Association for Computing Machinery
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 42,   Citation Count: 12
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1046192.1046206
What is a DOI?

ABSTRACT

Configurable processors are becoming increasingly popular for modern embedded systems (especially for the field-programmable system-on-a-chip). While steady progress has been made in the tools and methodologies of automatic instruction set extension for configurable processors, the limited data bandwidth available in the core processor (e.g., the number of simultaneous accesses to the register file) becomes a potential performance bottleneck. In this paper we first present a quantitative analysis of the data bandwidth limitation in configurable processors, and then propose a novel low-cost architectural extension and associated compilation techniques to address the problem. The application of our approach results in a promising performance improvement.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
D. Burger, T. Austin, and S. Bennett, "Evaluating Future Microprocessors: The SimpleScalar Toolset," Technical Report, CS-TR96-1308, Univ. of Wisconsin - Madison, 1996.
 
4
5
6
7
8
 
9
C. Greene and D. Kleitman, "The Structure of Sperner K-Family," J. Combinatorial Theory, Ser. A, vol. 20, pp. 80--88, 1976.
 
10
M. R. Guthaus et al., "MiBench: A Free, Commercially Representative Embedded Benchmark Suite," in IEEE 4th Workshop on Workload Characterization, Dec. 2001.
 
11
 
12
P. Ienne, L. Pozzi, and M. Vuletic, "On the Limits of Processor Specialisation by Mapping Dataflow Sections on Ad-hoc Functional Units," Technical Report 01/376, Swiss Federal Institute of Technology Lausanne, Computer Science Department, Dec. 2001.
13
 
14
 
15
 
16
 
17
 
18
S. Rixner, W. J. Dally, B. Khailany, P. Mattson, U. J. Kapasi, and J. D. Owens, "Register Organization for Media Processing," in Proc. Sixth International Symposium on High-Performance Computer Architecture, pp. 375--386, Jan. 2000.
19
 
20
 
21
R. D. Wittig and P. Chow, "OneChip: An FPGA Processor with Reconfigurable Logic," in Proc. 4th Annual IEEE Symposium on FPGAs for Custom Computing Machines, pp. 126--135, March 1996.
22
 
23
Altera Corp., http://www.altera.com.
 
24
Tensilica Inc., http://www.tensilica.com.
 
25
Xilinx Inc., http://www.xilinx.com.

CITED BY  12

Collaborative Colleagues:
Jason Cong: colleagues
Yiping Fan: colleagues
Guoling Han: colleagues
Ashok Jagannathan: colleagues
Glenn Reinman: colleagues
Zhiru Zhang: colleagues