【摘要】：片上網(wǎng)絡(luò)是解決大規(guī)模片上多處理器系統(tǒng)中片上通信問(wèn)題的有效途徑。與基于總線的方式相比,片上網(wǎng)絡(luò)使用網(wǎng)絡(luò)互連的方式進(jìn)行通信,這有效的降低了通信功耗、緩解了帶寬爭(zhēng)奪、提高了通信的可靠性、簡(jiǎn)化了硬件體系結(jié)構(gòu),具有良好的可伸縮性。蟲(chóng)洞交換網(wǎng)絡(luò)是片上網(wǎng)絡(luò)系統(tǒng)中非常常見(jiàn)的通信機(jī)制。蟲(chóng)洞交換由于自身的傳輸機(jī)制,對(duì)緩存的需求量非常小,因此它非常適合受成本、功耗、面積等方面嚴(yán)格限制的片上網(wǎng)絡(luò)系統(tǒng)。本課題主要研究了基于蟲(chóng)洞交換的片上網(wǎng)絡(luò)系統(tǒng)端到端任務(wù)截止期規(guī)劃的問(wèn)題。 在片上網(wǎng)絡(luò)系統(tǒng)中,有些任務(wù)需要芯片內(nèi)多核和片上網(wǎng)絡(luò)相互協(xié)同合作,才能完成該任務(wù)的執(zhí)行,這些任務(wù)可能需要若干個(gè)核和若干個(gè)通信按照一定的順序協(xié)同地工作來(lái)完成,這些任務(wù)被稱作端到端任務(wù)。由于片上網(wǎng)絡(luò)實(shí)時(shí)性研究起步較晚,至今沒(méi)有關(guān)于片上網(wǎng)絡(luò)中端到端任務(wù)實(shí)時(shí)性的研究,隨著多媒體業(yè)務(wù)和實(shí)時(shí)業(yè)務(wù)的不斷涌現(xiàn),這將是片上網(wǎng)絡(luò)研究領(lǐng)域中亟待解決的問(wèn)題之一。 端到端任務(wù)的實(shí)時(shí)性研究常見(jiàn)問(wèn)題有端到端各子任務(wù)的截止期分配、各子任務(wù)的同步問(wèn)題、任務(wù)優(yōu)先級(jí)分配問(wèn)題等。本文將針對(duì)片上網(wǎng)絡(luò)中端到端任務(wù)中各子任務(wù)的截止期分配問(wèn)題進(jìn)行研究。本文采用兩種不同的基于時(shí)間片的調(diào)度算法分別對(duì)片上網(wǎng)絡(luò)中端到端任務(wù)中計(jì)算子任務(wù)和通信子任務(wù)進(jìn)行調(diào)度,然后提出了三種啟發(fā)式算法來(lái)為系統(tǒng)中各個(gè)端到端任務(wù)中的各個(gè)子任務(wù)確定截止期,從而使系統(tǒng)中各個(gè)資源的利用率滿足基于時(shí)間片調(diào)度算法的約束條件。 本文實(shí)驗(yàn)部分分析了影響算法接收率的四個(gè)因子,然后分別對(duì)這四個(gè)因子做了相關(guān)實(shí)驗(yàn),每部分實(shí)驗(yàn)都將文中提出的截止期分配算法與已有的經(jīng)典PD算法進(jìn)行比較,實(shí)驗(yàn)結(jié)果表明本文提出的算法能更加有效地滿足實(shí)時(shí)性約束。
[Abstract]:On-chip network is an effective way to solve the problem of communication on-chip in large-scale multi-processor system. Compared with the bus based mode, the on-chip network uses the network interconnection mode to communicate, which effectively reduces the communication power consumption, alleviates the bandwidth contention, improves the reliability of the communication, and simplifies the hardware architecture. Good scalability. Wormhole switching network is a very common communication mechanism in on-chip network systems. Due to its own transmission mechanism, wormhole exchange has a very small demand for cache, so it is very suitable for the on-chip network system which is strictly limited by cost, power consumption, area and so on. In this paper, the problem of end-to-end task deadline planning based on wormhole switching is studied. In the on-chip network system, some tasks require the cooperation of multi-core and on-chip network in order to complete the task. These tasks may require several cores and several communications to work together in a certain order. These tasks are called end-to-end tasks. Due to the late start of real-time research on on-chip network, there has been no research on real-time end-to-end tasks in on-chip network. With the continuous emergence of multimedia services and real-time services, This will be one of the problems to be solved in the field of on-chip network research. Research on End-to-End tasks Real-Time problems include deadline assignment of end-to-end subtasks, synchronization of sub-tasks, priority assignment of tasks, and so on. In this paper, the deadline assignment problem of end-to-end tasks in on-chip network is studied. In this paper, two different scheduling algorithms based on time slice are used to schedule computing subtasks and communication subtasks in on-chip network end-to-end tasks, respectively. Then, three heuristic algorithms are proposed to determine the deadline for each sub-task in each end-to-end task of the system, so that the utilization rate of each resource in the system meets the constraints of the time-slice scheduling algorithm. In the experiment part, we analyze the four factors that affect the rate of the algorithm, and then do some experiments on the four factors. Each part of the experiment compares the proposed deadline assignment algorithm with the classical PD algorithm. Experimental results show that the proposed algorithm can meet the real-time constraints more effectively.
【學(xué)位授予單位】：東北大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2012
【分類號(hào)】：TP332

【參考文獻(xiàn)】

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

1 朱運(yùn)航;李雪東;;基于IP核復(fù)用的SoC設(shè)計(jì)技術(shù)探討[J];微計(jì)算機(jī)信息;2006年08期

2 王芳莉;杜慧敏;;片上網(wǎng)絡(luò)路由算法綜述[J];西安郵電學(xué)院學(xué)報(bào);2011年01期

，

本文編號(hào)：2192289