Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Compile-time reordering of low level instructions is successful in achieving large increases in performance of programs on fine-grain parallel machines. Hover, because of the interdependences beten instruction scheduling rand register allocation, a lack of cooperation beten the schedules and register allocator can result in generating code that contains excess register spills and/or a lor degree of parallelism than actually achievable.  describes a strategy for providing cooperation beten register allocation and both global and local instruction scheduling.  experimentally compare this strategy with other cooperative and uncooperative scenarios. Our experiments indicate that the greatest speedups are obtained by performing either cooperative or uncooperative global instruction scheduling with cooperative register allocation and local instruction scheduling.
['Cindy Norris', 'Lori L. Pollock']
I am writing a research paper on a idea An experimental study of several cooperative register allocation and instruction scheduling strategies
[{"from": "human", "value": "I am writing a research paper on a idea An experimental study of several cooperative register allocation and instruction scheduling strategies"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Compile-time reordering of low level instructions is successful in achieving large increases in performance of programs on fine-grain parallel machines. Hover, because of the interdependences beten instruction scheduling rand register allocation, a lack of cooperation beten the schedules and register allocator can result in generating code that contains excess register spills and/or a lor degree of parallelism than actually achievable.  describes a strategy for providing cooperation beten register allocation and both global and local instruction scheduling.  experimentally compare this strategy with other cooperative and uncooperative scenarios. Our experiments indicate that the greatest speedups are obtained by performing either cooperative or uncooperative global instruction scheduling with cooperative register allocation and local instruction scheduling."}]