T. A. Proebsting. Code Generation Techniques. PhD thesis, University of Wisconsin - Madison, 1992. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Redesigning Hardware-Software Systems - Coelho, Jr., Yang, De Micheli.. (1994) (1 citation) (Correct)
....can only start execution after another set of computations that execute in non deterministic time (such as loops and synchronizations with external events) have finished. Since each thread executes in deterministic time once it is started, we can apply conventional code generation for basic blocks [14, 1] in order to generate the code for the operations in the thread. The scheduling of threads over time, however, depends on control and data transfers, and thus a control data driven scheduler is used in the software that allows both software and hardware to schedule threads over time. For further ....
....a directed acyclic graph for the thread, where the nodes are data flow or HSI O operations. Figure 9 presents a graph in which the shaded node corresponds to an HSI O operation. For each of the nodes of this graph, we select the instructions by expression tree matching algorithms, such as Burg [14], with a fixed number of registers. The instruction selection step also provides the execution time for each node of the thread, in terms of cycles. After obtaining a schedule for each node of the thread, we have to schedule the nodes sequentially such that the HSI O operations observe the timing ....
T. A. Proebsting. Code Generation Techniques. PhD thesis, University of Wisconsin - Madison, 1992.
Optimal Code-Selection using MBURG - John Gough Jeff (Correct)
....into a finite set of equivalence classes. The pattern matchers generated by this method may use as little as 50 machine cycles per match. The price which is paid is the loss of flexibility, as the grammars may have neither guarded productions, nor non constant cost functions. Proebsting s thesis[12] gives a comprehensive bibliography of all of the theory which lies behind this tool. IBURG[4] and the closely related tool lburg, used by lcc[3] both perform their dynamic programming at compiler runtime. They accept conditional expressions as production costs, and produce their matchers in ....
Todd A Proebsting. Code Generation Techniques. Ph.D. thesis, University of Wisconsin -- Madison, 1992.
On the Automatic Generation of Instruction Selector Using.. - Kang, Choe (1995) (Correct)
....The code generation schemes depend on which IR code compiler uses: Abstract machine, Trees, DAGs, etc [Dav93] In this paper, the tree structure is used to represent IR code. The instruction selection of the code generator plays an important role to generate a efficient code for CISC machines [PrF92]. Code generation involves selecting the appropriate target language instructions, determining an evaluation order for operations and assigning registers to hold values [ASU86] Among these issues, the instruction selection determines which instructions can do best the computation of the program. ....
....SLR(1) parsing. The tree pattern matching techniques are divided into two methods by matching methodology, namely, top down tree pattern matching, bottom up tree pattern matching. BURS(Bottom Up Rewrite System) technology produces extremely fast code generators with bottom up tree pattern matching [HOD82, Cha87, BDB90, FHP93, FHP91, PrF92]. However, the code generator generator requires a lot of time and space to generate a code generator for a CISC machine [PrF92] In this paper, the problems of BURS technology and the general description of tree patterns for a machine instructions to solve the problems is addressed. 1.2 ....
[Article contains additional citation context not shown here]
Todd A. Proebsting, Charles Fischer. "Code Generation Techniques", PhD Dissertation, Department of Computer Science, University of Wisconsin-Madison, 1992.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC