![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
Abstract
In this paper we describe a novel approach to the scheduling and instruction selection phases of code generation. Our approach mimics that used by human programmers and combines heuristic search with hierarchical planning and a modified means-ends analysis. Optimal code generation is known to be NP-Complete hard. Our algorithm can be executed in time polynomial to the size of the input program and exponential only to the depth of the search. Empirical results show that very good results can be accomplished with depths as small as 3. The quality of the generated code is comparable (in some cases superior) to that of codes generated by human digital signal processing experts.