嵌入式系統(tǒng)寄存器分配:?jiǎn)l(fā)式與進(jìn)化算法
發(fā)布時(shí)間:2018-06-03 15:26
本文選題:嵌入式系統(tǒng) + 寄存器分配; 參考:《西安電子科技大學(xué)》2012年碩士論文
【摘要】:在信息和網(wǎng)絡(luò)技術(shù)高速發(fā)展的后PC時(shí)代,嵌入式系統(tǒng)已經(jīng)滲透到科學(xué)研究、工程設(shè)計(jì)等各個(gè)領(lǐng)域中。由于嵌入式系統(tǒng)更看重于應(yīng)用,所以要求在嵌入式系統(tǒng)中經(jīng)過(guò)編譯后能得到高質(zhì)量的代碼。在嵌入式系統(tǒng)編譯優(yōu)化的過(guò)程中,最重要的部分是對(duì)嵌入式系統(tǒng)寄存器分配的優(yōu)化,讓盡可能多的中間變量保存在寄存器中有助于我們獲得高質(zhì)量的代碼。本文在對(duì)嵌入式系統(tǒng)寄存器分配算法進(jìn)行充分的研究的基礎(chǔ)上,提出了基于最大團(tuán)的嵌入式系統(tǒng)寄存器分配算法、基于分割圖的嵌入式系統(tǒng)寄存器分配算法和基于Memetic算法的嵌入式系統(tǒng)寄存器分配方法。 (1)提出了基于最大團(tuán)的嵌入式系統(tǒng)寄存器分配算法。該算法引入補(bǔ)圖思想,將中間變量相互干擾圖取補(bǔ)圖后,巧妙的使用尋找最大團(tuán)操作,得到了一種很好的啟發(fā)式算法,實(shí)驗(yàn)部分通過(guò)與經(jīng)典的啟發(fā)式算法進(jìn)行對(duì)比,證實(shí)了基于最大團(tuán)的嵌入式系統(tǒng)寄存器分配算法確實(shí)能得到更好的寄存器分配方案。 (2)提出了基于分割圖的嵌入式系統(tǒng)寄存器分配算法。在前一個(gè)創(chuàng)新點(diǎn)的基礎(chǔ)上,引入分割圖概念,細(xì)化尋找最大團(tuán)的過(guò)程,充分的利用節(jié)點(diǎn)的溢出代價(jià),并且引入局部搜索算子對(duì)寄存器分配的初步結(jié)果進(jìn)行優(yōu)化。實(shí)驗(yàn)部分通過(guò)與經(jīng)典啟發(fā)式算法以及兩種進(jìn)化算法對(duì)比,證實(shí)了基于分割圖的嵌入式系統(tǒng)寄存器分配算法能夠在較短的時(shí)間內(nèi)得到非常好的寄存器分配方案,性能接近進(jìn)化算法。 (3)基于Memetic算法的嵌入式系統(tǒng)寄存器分配。通過(guò)對(duì)原有混合進(jìn)化算法的交叉算子和評(píng)價(jià)函數(shù)的改進(jìn),得到了基于Memetic算法的嵌入式系統(tǒng)寄存器分配方法。在交叉算子中充分考慮了中間變量溢出代價(jià)的作用及影響,引入了一個(gè)新的適應(yīng)度評(píng)價(jià)函數(shù)來(lái)判斷種群個(gè)體的優(yōu)劣,加強(qiáng)種群進(jìn)化方向。實(shí)驗(yàn)部分通過(guò)與原進(jìn)化算法對(duì)比,證實(shí)了確實(shí)對(duì)進(jìn)化算法有明顯改進(jìn)。
[Abstract]:In the post - PC era of high - speed development of information and network technology , the embedded system has been infiltrated into various fields such as scientific research and engineering design . In the process of compilation and optimization of embedded system , it is required to obtain high - quality code in embedded system . In the process of compilation and optimization of embedded system , the most important part is to optimize the register allocation of embedded system .
( 1 ) An embedded system register allocation algorithm based on the maximum clique is proposed . The algorithm introduces the complementary graph idea . After the intermediate variables are disturbed with each other , a good heuristic algorithm is obtained . The experimental part is compared with the classical heuristic algorithm , which proves that the embedded system register allocation algorithm based on the maximum cluster can get a better register allocation scheme .
( 2 ) An embedded system register allocation algorithm based on partition diagram is proposed . On the basis of the previous innovation point , we introduce the concept of segmentation map , refine the process of finding the largest cluster , fully utilize the overflow cost of the node , and introduce the local search operator to optimize the initial results of register allocation .
( 3 ) An embedded system register allocation method based on the Memetic algorithm is proposed . Based on the improvement of the crossover operator and the evaluation function of the original hybrid evolutionary algorithm , an embedded system register allocation method based on the Memetic algorithm is obtained . In the crossover operator , the function and influence of the overflow cost of the intermediate variable are fully taken into account , and a new fitness evaluation function is introduced to judge the population individual ' s advantages and disadvantages and to strengthen the population evolution direction .
【學(xué)位授予單位】:西安電子科技大學(xué)
【學(xué)位級(jí)別】:碩士
【學(xué)位授予年份】:2012
【分類號(hào)】:TP368.1
【共引文獻(xiàn)】
相關(guān)期刊論文 前10條
1 王學(xué)平;楊雁;;布爾矩陣的可實(shí)現(xiàn)問(wèn)題及其與色數(shù)問(wèn)題的關(guān)系[J];高校應(yīng)用數(shù)學(xué)學(xué)報(bào)A輯;2010年01期
2 李小強(qiáng);張寧;;基于獨(dú)立集劃分的圖著色算法[J];哈爾濱理工大學(xué)學(xué)報(bào);2010年05期
3 朱軍;唐常杰;魏大剛;段磊;左R,
本文編號(hào):1973271
本文鏈接:http://sikaile.net/kejilunwen/jisuanjikexuelunwen/1973271.html
最近更新
教材專著