ACM Home Page
Please provide us with feedback. Feedback
Co-synthesis of pipelined structures and instruction reordering constraints for instruction set processors
Full text PdfPdf (1.58 MB)
Source ACM Transactions on Design Automation of Electronic Systems (TODAES) archive
Volume 6 ,  Issue 1  (January 2001) table of contents
Pages: 93 - 121  
Year of Publication: 2001
ISSN:1084-4309
Author
Ing-Jer Huang  National Sun Yat-Sen Univ., Kaohsiung, Taiwan
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 28,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues   peer to peer  

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/371254.371268
What is a DOI?

ABSTRACT

This paper presents a hardware/software co-synthesis approach to pipelined ISP (instruction set processor) design. The approach synthesizes the pipeline structure from a given instruction set architecture (behavioral) specification. In addition, it generates a set of reordering constraints that guides the compiler back-end (reorderer) to properly schedule instructions so that possible pipeline hazards are avoided and throughput is improved.Co-synthesis takes place while resolving pipeline hazards, which can be attributed to interin-struction dependencies (IIDs). An extended taxonomy of IIDs have been proposed for the systematic analysis of pipeline hazards. Hardware/software methods are developed to resolve IIDs. Algorithms based on taxonomy and resolutions are constructed and integrated into the pipeline synthesis process to explore hardware and software design space. Application benchmarks are used to evaluate possible designs and guide the design decision. The power of the co-synthesis tool PIPER is demonstrated through pipeline synthesis of one illustrative example and two ISPs, including an industrial one (TDY-43). In comparison with other related approaches, our approach achieves higher throughput and provides a systematic way to explore the hardware/software trade-off.


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
CARLTON, M. 1991. Source codes of the Aquarius prolog compiler (Back-end). Computer Science Department, University of California at Berkeley, Berkeley, CA.
3
 
4
 
5
CLOUTIER, R. 1993. Synthesis of pipelined instruction set processors. Ph.D. Dissertation. Dept. of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA.
 
6
FISHER, J. 1981. Trace scheduling: A technique for global microcode compaction. IEEE Trans. Comput. C-30, 7 (July), 478-490.
7
 
8
GOOSSENS, G., RABAEY, J., VANDEWALLE, J., AND DE MAN, H. 1990. An efficient microcode compiler for application specific DSP processors. IEEE Trans. Comput.-Aided Des. 9,9 (Sept.), 925-937.
 
9
GRAHAM, S. L. 1980. Table-driven code generation. IEEE Computer 13, 8 (Aug.).
10
 
11
 
12
HUANG, I.-J. 1997. Synthesis and analysis of an industrial embedded microcontrol. In Proceedings of the Conference on Asia and South Pacific Design Automation (Jan.). ACM Press, New York, NY.
13
 
14
 
15
KOGGE, P. M. 1981. The Architecture of Pipelined Computers. McGraw-Hill, Inc., New York, NY.
 
16
 
17
 
18
LIEM,C.M.T.AND PAULIN, P. 1994. Instruction-set matching and selection for DSP and ASIP code generation. In Proceedings of the 1994 Conference on European Design and Test (Paris, France, Feb.). 31-37.
 
19
 
20
PARK,N.AND PARKER, A. C. 1988. Sehwa: A software package for synthesis of pipelines from behavioral specifications. IEEE Trans. Comput.-Aided Des. Integr. Circuits 7, 3 (Mar.), 356-368.
21
 
22
PAULIN,P.G.AND KNIGHT, J. P. 1989. Force-directed scheduling for the behavioral synthesis of ASICs. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 8, 6 (June), 661-679.
 
23
 
24
SU, C.-L. AND DESPAIN, A. 1992. An instruction scheduler and register allocator for prolog parallel microprocessors. In Proceedings of the Conference on International Computer Symposium.
 
25
TELEDYNE SYSTEMS CO. 1988. Programming Manual for the Teledyne TDY-43 Computer.
 
26
TOMASULO, R. M. 1967. An efficient algorithm for exploiting multiple arithmetic units. IBM J. Res. Dev. 11, 1 (Jan.), 25-33.
 
27


Peer to Peer - Readers of this Article have also read: