【摘要】：研究了眾核處理器的訪存公平性問(wèn)題。針對(duì)眾核處理器距離訪存資源較近的處理單元擁有較大的訪存帶寬而造成的訪存公平性問(wèn)題,提出了一種面向大數(shù)據(jù)應(yīng)用的眾核處理器訪存公平性調(diào)度機(jī)制:最少最遠(yuǎn)(LFF)優(yōu)先訪存。這種機(jī)制的原理如下:依據(jù)處理單元距離訪存資源的距離以及處理單元訪存的次數(shù)來(lái)調(diào)度訪存順序,以保證各個(gè)處理單元的公平性。首先,訪問(wèn)次數(shù)較少的節(jié)點(diǎn)被賦予更高的訪存優(yōu)先權(quán)。其次,在具有相同訪問(wèn)次數(shù)的節(jié)點(diǎn)中,距離更遠(yuǎn)的節(jié)點(diǎn)優(yōu)先訪存。再次,在相同距離的節(jié)點(diǎn)中,已被選中優(yōu)先次數(shù)少的有優(yōu)先級(jí)。實(shí)驗(yàn)評(píng)估表明,該調(diào)度機(jī)制能夠有效解決眾核處理器的訪存公平性問(wèn)題,其公平性調(diào)度效果優(yōu)于FR-FCFS,PAR-BS、ATLAS。在1024核情況下,系統(tǒng)異步率由FR-FCFS的15.5%降低到1.89%。
[Abstract]:The problem of memory access fairness for multicore processors is studied. In view of the fairness of accessing memory caused by the larger access bandwidth of multi-core processor, the processing unit which is close to memory access resource has a lot of memory access bandwidth. In this paper, a scheduling mechanism for accessing memory fairness of multicore processor based on big data is proposed: minimum farthest (LFF) priority access. The principle of this mechanism is as follows: according to the distance between the processing unit and the memory access resource and the number of times the processing unit accesses the memory access order is scheduled to ensure the fairness of each processing unit. First, nodes with fewer accesses are given higher access priority. Second, in nodes with the same number of visits, the more distant nodes have priority access. Again, at the same distance, the node that has been selected with less priority has priority. The experimental results show that the scheduling mechanism can effectively solve the memory access fairness problem of multi-core processors, and its fairness scheduling effect is better than that of FR-FCFS,PAR-BS,ATLAS.. In the case of 1024 core, the asynchronous rate of the system is reduced from 15. 5% of FR-FCFS to 1. 89%.
【作者單位】： 計(jì)算機(jī)體系結(jié)構(gòu)國(guó)家重點(diǎn)實(shí)驗(yàn)室(中國(guó)科學(xué)院計(jì)算技術(shù)研究所);中國(guó)科學(xué)院大學(xué)計(jì)算機(jī)與控制學(xué)院;數(shù)學(xué)工程與先進(jìn)計(jì)算國(guó)家重點(diǎn)實(shí)驗(yàn)室;
【基金】：國(guó)家自然科學(xué)基金(61332009);國(guó)家自然科學(xué)基金創(chuàng)新研究群體科學(xué)基金(61521092) 國(guó)家重點(diǎn)研發(fā)計(jì)劃課題(2016YFB0200501) 北京市科委項(xiàng)目(Z151100003615006)資助項(xiàng)目
【分類(lèi)號(hào)】：TP311.13;TP332

【相似文獻(xiàn)】

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

1 王濟(jì)勇,趙海,林濤,王小英,王金東,韓光潔;定時(shí)器驅(qū)動(dòng)的RM調(diào)度機(jī)制建模及其性能優(yōu)化[J];計(jì)算機(jī)學(xué)報(bào);2005年02期

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

1 劉磊;異構(gòu)五核XDSP調(diào)度機(jī)制的設(shè)計(jì)與實(shí)現(xiàn)[D];國(guó)防科學(xué)技術(shù)大學(xué);2013年

2 仇文娟;云計(jì)算中依賴(lài)任務(wù)動(dòng)態(tài)并行調(diào)度機(jī)制的研究[D];大連理工大學(xué);2011年

3 閆英輝;云計(jì)算架構(gòu)及調(diào)度機(jī)制的研究[D];大連理工大學(xué);2011年

4 侯旭萌;基于BitTorrent的流媒體緩存及調(diào)度機(jī)制研究[D];燕山大學(xué);2012年

，

本文編號(hào)：2366568