|
ABSTRACT
Horizontal Microcoded Architecture (HMA) is a paradigm for designing programmable high-performance processing elements (PEs). However, it suffers from large code size, which can be addressed by compression. In this article, we study the code size of one of the new HMA-based technologies called No-Instruction-Set Computer (NISC). We show that NISC code size can be several times larger than a typical RISC processor, and we propose several low-overhead dictionary-based code compression techniques to reduce its code size. Our compression algorithm leverages the knowledge of “don't care” values in the control words and can reduce the code size by 3.3 times, on average. Despite such good results, as shown in this article, these compression techniques lead to poor FPGA implementations because they require many on-chip RAMs. To address this issue, we introduce an FPGA-aware dictionary-based technique that uses the dual-port feature of on-chip RAMs to reduce the number of utilized block RAMs by half. Additionally, we propose cascading two-levels of dictionaries for code size and block RAM reduction of large programs. For an MP3 application, a merged, cascaded, three-dictionary implementation reduces the number of utilized block RAMs by 4.3 times (76%) compared to a NISC without compression. This corresponds to 20% additional savings over the best single level dictionary-based compression.
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
|
Agrawala, A. and Rauscher, T. 1976. Foundations of Microprogramming: Architecture, Software, and Applications. Academic Press.
|
| |
2
|
Codwell, R., Nix, R., Donnell, J., Papworth, D., and Rodman, P. 1987. A VLIW architecture for a trace scheduling compiler. ACM SIGOPS Operat. Syst. Rev. 21, 4.
|
 |
3
|
|
| |
4
|
Fraser, C. 2002. An instruction for direct interpretation of LZ77-compressed programs. Tech. rep. MSR-TR-2002-90, Microsoft Research, Microsoft Corporation.
|
| |
5
|
|
| |
6
|
Gorjiara, B. 2007. Synthesis and optimization of custom low-power NISC processors. Ph.D. dissertation, University of California, Irvine.
|
| |
7
|
Gorjiara, B. and Gajski, D. 2005. Custom processor design using NISC: A case-study on DCT algorithm. In Proceedings of the IEEE Workshop on Embedded Systems for Real-Time Multimedia (ESTIMedia).
|
| |
8
|
Gorjiara, B. and Gajski, D. 2007. A novel profile-driven technique for simultaneous power and code-size optimization of nanocoded IPs. In Proceedings of the International Conference on Computer Design (ICCD).
|
 |
9
|
|
 |
10
|
|
| |
11
|
Grehan, R. 1997. 16-bit: The good, the bad, your options. Embed. Syst. Prog.
|
| |
12
|
Ishiura, N. and Yamaguchi, M. 1997. Instruction code compression for application specific VLIW processors based on automatic field partitioning. In Proceedings of the International Conference on Synthesis and System Integration of Mixed Information System (SASIMI).
|
| |
13
|
Jensen, T. and Toft, B. 1995. Graph Coloring Problems. Wiley-Interscience. New York.
|
| |
14
|
|
 |
15
|
Jeremy Lau , Stefan Schoenmackers , Timothy Sherwood , Brad Calder, Reducing code size with echo instructions, Proceedings of the 2003 international conference on Compilers, architecture and synthesis for embedded systems, October 30-November 01, 2003, San Jose, California, USA
[doi> 10.1145/951710.951724]
|
| |
16
|
|
 |
17
|
|
| |
18
|
|
| |
19
|
|
| |
20
|
B. Ramakrishna Rau , David W. L. Yen , Wei Yen , Ross A. Towie, The Cydra 5 Departmental Supercomputer: Design Philosophies, Decisions, and Trade-Offs, Computer, v.22 n.1, p.12-26, 28-30, 32-35, January 1989
[doi> 10.1109/2.19820]
|
| |
21
|
|
 |
22
|
|
| |
23
|
|
| |
24
|
|
 |
25
|
|
 |
26
|
|
| |
27
|
Saghir, M. 1998. Application-specific instruction-set architectures for embedded SDP applications. Ph.D. thesis, University of Toronto.
|
| |
28
|
|
| |
29
|
|
| |
30
|
Wang, K. 2001. Code compaction for VLIW instructions. M.S. thesis, University of Toronto.
|
 |
31
|
|
 |
32
|
|
| |
33
|
|
|