Parallelizing queue compiler
Year: 2008
Type: dissertation
Abstract: Queue processors arrange high-speed registers in a first-in first-out queue. All readaccesses are performed in the head of the queue and all writes at the tail. Thiscomputation model is substantially different from conventional random access registermachines and stack machines. Traditional code generation methods cannot be applied toqueue machines, therefore, this doctoral dissertation presents the design and developmentof a parallelizing queue compiler framework. The queue compiler translates any programwritten in C language into queue processor’s machine code. The most importantcharacteristic of the queue compiler is the integration of the queue computing principle inall stages of code generation, making it the first available true queue compiler. Novel andefficient algorithms and data structures have been developed to facilitate and solve all theproblems related to compilation for the queue model. This work is the result of two years ofresearch and development, and it provides efficient solutions to a broad range of problemson queue computing including the principles of compiler development, automatic codegeneration, offset calculation, scheduling, parallelization, optimization, data allocation,and constrained compilation. Internally, the queue compiler is completely different toany other existing compiler, this due to the special characteristics of queue computing.First, control flow and data flow graphs of the input program are generated. Then a setof custom analyses and transformations are performed to compute the offset referencevalues. Finally, the data flow graph is scheduled in a level-order manner to generate thefinal instruction sequence for the target queue machine. The compiler is also capableof producing code for a set of objective functions such as code size, high parallelism,high performance, offset reference control, and queue control. The queue compiler hasbeen successfully completed and any program, including itself, can be compiled into queueobject code. Quantitatively and qualitatively, the generated queue programs are similar tothe ones generated by conventional register compilers in terms of number of instructions,parallelism, code size, and instruction distribution.
Author: Arquimedes Canedo
Institution: University of Electro-Communications
Language: English
Subfield: Hardware and Architecture
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2181919661
