【摘要】：NoC因其可靠性高和可擴展性好等優(yōu)點,已經(jīng)被研究的越來越多。集成電路的測試伴隨著芯片的設(shè)計、驗證、生產(chǎn)和后期維護等整個生命周期。在NoC中,IP核通過路由器來相互通信。對于IP核的測試,一種通用的做法是復(fù)用已有的NoC通信架構(gòu)來傳輸測試數(shù)據(jù)。但是在復(fù)用NoC架構(gòu)作為測試訪問機制對內(nèi)嵌核測試時,如果有多個I/O接口并行測試時就容易發(fā)生資源的沖突。同時,在很多測試方法中,測試路徑的建立以及測試響應(yīng)的收集等在網(wǎng)絡(luò)接口(NI, network interface)中實現(xiàn)。但作為NoC的重要組成部分,關(guān)于NI的可靠性研究卻往往被忽略。因此,本課題針對以上問題,分別從并行測試調(diào)度和NI可靠性兩方面展開研究。論文主要工作如下：(1)為了解決多區(qū)域并行測試的資源沖突問題,提出一種無鏈路沖突的測試調(diào)度方法。首先使用分區(qū)算法將網(wǎng)絡(luò)劃分多個區(qū)域,然后使用鏈路分配算法對節(jié)點建立路徑樹來查找可連通路徑,最后全局考慮各個區(qū)域的連通路徑來分配鏈路使所有區(qū)域都連通,從而避免資源沖突、減少測試時間、保證測試可靠性。實驗結(jié)果表明,相對于基準(zhǔn)對象,該方法可減少測試時間14.13%～52.62%,相比于已有算法,測試時間最多減少了16.42%,是一種較優(yōu)的無沖突測試調(diào)度方法。(2)針對NI的可靠性以及可能的數(shù)據(jù)包亂序問題。本文提出一種支持重排序的高可靠NI設(shè)計。首先通過在NI發(fā)送端和接收端都使用雙虛通道設(shè)計,達到與路由器高效互連的目的,同時增加了NI可靠性。其次,設(shè)計一種新的重排序方法,對重排序buffer使用一種鏈?zhǔn)讲檎冶淼姆绞綄崿F(xiàn)對亂序數(shù)據(jù)包的高效重排序,同時增加了buffer的利用率。
[Abstract]:NoC has been studied more and more because of its high reliability and good scalability. Integrated circuit testing is accompanied by chip design, verification, production and post-maintenance throughout the life cycle. In NoC, the IP core communicates with each other through routers. For IP core testing, a general approach is to reuse the existing NoC communication architecture to transmit test data. However, when reusing NoC architecture as a test access mechanism, embedded kernel testing, if there are multiple I / O interfaces parallel testing, will be prone to resource conflicts. At the same time, in many test methods, the establishment of test path and the collection of test response are implemented in the network interface (NI, network interface). However, as an important part of NoC, the research on reliability of NI is often ignored. Therefore, aiming at the above problems, the parallel test scheduling and NI reliability are studied in this paper. The main work of this paper is as follows: (1) in order to solve the resource collision problem of multi-area parallel testing, a link-free test scheduling method is proposed. Firstly, the network is divided into several regions by using the partition algorithm, then the link allocation algorithm is used to establish a path tree for the nodes to find the accessible path, and finally, the connected paths of each area are considered globally to allocate the links so that all the areas are connected. So as to avoid resource conflict, reduce test time and ensure test reliability. The experimental results show that the proposed method can reduce the test time by 14.13% and 52.62%, and the test time can be reduced by up to 16.42% compared with the existing algorithms. It is an optimal conflict-free test scheduling method. (2) aiming at the reliability of NI and the possible packet disorder problem. This paper presents a highly reliable NI design that supports reordering. First, the dual virtual channel design is used in the NI transmitter and receiver to achieve the purpose of efficient interconnection with the router, and at the same time, the reliability of the NI is increased. Secondly, a new reordering method is designed, which uses a chain look-up table to realize the efficient reordering of out-of-order packets for reordering buffer, and increases the utilization of buffer at the same time.
【學(xué)位授予單位】：合肥工業(yè)大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2015
【分類號】：TN407

【相似文獻】

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

1 張敦行;張廣興;張大方;謝高崗;于真;;基于多空間內(nèi)存共享的高速網(wǎng)絡(luò)鏈路數(shù)據(jù)包捕獲方法[J];計算機應(yīng)用研究;2008年03期

2 閻冬;王玉龍;蘇森;楊放春;;基于協(xié)作交互的概率性數(shù)據(jù)包標(biāo)記溯源方法[J];北京郵電大學(xué)學(xué)報;2012年01期

3 齊建業(yè);余祥;劉峻宇;李強;;協(xié)議一致性測試數(shù)據(jù)包的構(gòu)造與解析[J];西南科技大學(xué)學(xué)報;2013年04期

4 李虎雄;張文杰;;網(wǎng)絡(luò)交互平臺數(shù)據(jù)包的分析與處理[J];計算機工程與設(shè)計;2007年08期

5 王鋼,劉暉,蘇雁泳;IP電話數(shù)據(jù)包優(yōu)先級設(shè)置及對QoS影響的研究[J];哈爾濱工業(yè)大學(xué)學(xué)報;2002年04期

6 俞瑾;王偉明;;基于IXDP2401的轉(zhuǎn)發(fā)件間數(shù)據(jù)包處理信息傳輸方法的研究[J];現(xiàn)代電子技術(shù);2005年24期

7 韓曉非,王學(xué)光,楊明福;位并行數(shù)據(jù)包分類算法研究[J];華東理工大學(xué)學(xué)報;2003年05期

8 金慶輝;王東;楊建華;謝高崗;;一種網(wǎng)絡(luò)入侵檢測中的數(shù)據(jù)包采樣方法[J];計算機應(yīng)用研究;2008年10期

9 ;風(fēng)河網(wǎng)絡(luò)加速平臺線速超過每秒2.1億個數(shù)據(jù)包[J];中國電子商情(基礎(chǔ)電子);2010年06期

10 羅章琪;黃昆;張大方;關(guān)洪濤;謝高崗;;面向數(shù)據(jù)包處理的眾核處理器核資源分配方法[J];計算機研究與發(fā)展;2014年06期

相關(guān)會議論文 前2條

1 向曉明;歐陽建權(quán);操璐;;基于Linux的802.11b WLAN捕包解析器的設(shè)計[A];虛擬運營與云計算——第十八屆全國青年通信學(xué)術(shù)年會論文集（上冊）[C];2013年

2 查達仁;荊繼武;林t燂，

本文編號：2452410