發(fā)布時間：2018-04-05 06:40

  本文選題：資源重用　切入點：操作數(shù)旁路　出處：《浙江大學(xué)》2012年碩士論文

【摘要】：指令發(fā)射機制的研究主要包括指令相關(guān)性檢查和操作數(shù)旁路機制、寄存器重命名方法以及指令發(fā)射隊列,本文分別對這三個方面進(jìn)行研究并提出了基于計數(shù)方式的操作數(shù)旁路方法、基于存儲資源迭代重用的寄存器重命名方法以及基于最老最先發(fā)射的集中分布式結(jié)構(gòu)指令發(fā)射隊列。 基于計數(shù)方式的操作數(shù)旁路方法通過對指令執(zhí)行周期數(shù)進(jìn)行遞減計數(shù)來判斷指令能夠獲得源操作數(shù)的時間,并通過對流水線級數(shù)的信息來確定旁路的路徑,緩解了指令間數(shù)據(jù)真相關(guān)性帶來的流水線停頓。 針對超標(biāo)量深流水線中物理寄存器資源沖突造成的流水線阻塞問題,本文提出了一種多指令共享同一物理寄存器資源的非阻塞指令發(fā)射方法。該方法可在物理寄存器資源沖突下繼續(xù)分配物理寄存器,利用發(fā)射緩沖隊列臨時緩沖沖突的指令,增加發(fā)射流水級實際可分配的物理寄存器數(shù)量,釋放發(fā)射窗口,提高物理寄存器使用的并行性。實驗結(jié)果表明,相對于傳統(tǒng)重命名方法,該方法可減少27.3%的物理寄存器資源實現(xiàn)傳統(tǒng)方法相同的性能。 基于最老最先發(fā)射的集中分布式指令發(fā)射隊列分別從隊列的發(fā)射行為和結(jié)構(gòu)出發(fā),通過移動隊列表項內(nèi)容的方式實現(xiàn)了最老最先發(fā)射的機制,提高了指令的執(zhí)行和退休效率,而集中分布式的指今發(fā)射隊列結(jié)構(gòu)在提高資源利用效率的同時并沒有給隊列的控制邏輯帶來復(fù)雜度。
[Abstract]:The research of instruction launching mechanism mainly includes instruction correlation checking and operand bypass mechanism , register renaming method and instruction transmission queue . In this paper , we study the three aspects and put forward an operand bypass method based on counting mode , register renaming method based on iterative reuse of storage resources , and distributed structure instruction transmission queue based on the oldest first transmission .

The operand bypass method based on the counting mode determines the time of the instruction to obtain the source operand by decreasing the number of instruction execution cycles , and determines the path of the bypass by information on the pipeline stage , and relieves the pipeline stall caused by the true correlation of the data between the instructions .

In order to solve the problem of pipeline congestion caused by the conflict of physical register resources in the superscalar deep pipeline , a non - blocking instruction transmission method for sharing the same physical register resources is presented in this paper . The method can continue to allocate the physical register under the conflict of physical register resources , increase the number of physical registers which can actually be allocated by transmitting the buffer queue , release the emission window and improve the parallelism of the physical register . The experimental results show that compared with the traditional renaming method , the method can reduce 27.3 % of the physical register resources to realize the same performance of the traditional method .

Based on the transmitting behavior and the structure of the queue , the oldest transmission mechanism is realized by the way of the contents of the mobile unit list , which improves the execution and retirement efficiency of the instruction , and the centralized distributed index transmission queue structure brings complexity to the control logic of the queue while improving the resource utilization efficiency .

【學(xué)位授予單位】：浙江大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2012
【分類號】：TP332

【參考文獻(xiàn)】

相關(guān)期刊論文 前1條

1 楊華;崔剛;劉宏偉;楊孝宗;;兩級分配多可用重命名寄存器[J];計算機學(xué)報;2006年10期

相關(guān)博士學(xué)位論文 前1條

1 孟建熠;超標(biāo)量嵌入式處理器關(guān)鍵技術(shù)設(shè)計研究[D];浙江大學(xué);2009年

，

本文編號：1713606