高技术通讯2017，Vol.27Issue(2)：103-111,9.DOI:10.3772/j.issn.1002-0470.2017.02.001
LFF:一种面向大数据应用的众核处理器访存公平性调度机制
LFF:A many-core processor's access fairness scheduling scheme for big data applications
摘要
Abstract
The memory access fairness problem of many-core processors was studied.Aiming at the memory access fairness problem that many-core processor's process units closer to the memory controller have higher memory access bandwidth, this study proposed a many-core processor's memory access fairness scheduling scheme for big data applications, called the least and furthest first (LFF) access scheme.This scheme schedules the order of memory access requests according to the distance from a processing unit to its access resource and a processing unit's access history.Firstly, the highest memory access priority is assigned to the nodes with least access request times.Secondly, for the nodes with same access request times, the furthest nodes access memory preferentially.Thirdly, among the nodes with the same distance, the nodes with less priority-assigned history access memory firstly.Our evaluation shows that the proposed scheme can efficiently solve the memory access fairness problem in many-core processors, and its effectiveness in fairness scheduling outperforms the schemes of FR-FCFS, PAR-BS and ATLAS.In the case of 1024 cores,the execution asynchronous rate was reduced to 1.89% from 15.5% compared with the FR-FCFS.关键词
大数据/众核处理器/公平性/调度Key words
big data/ many-core processor/ fairness/ scheduling引用本文复制引用
张洋,李文明,叶笑春,王达,范东睿,李宏亮,唐志敏,孙凝晖..LFF:一种面向大数据应用的众核处理器访存公平性调度机制[J].高技术通讯,2017,27(2):103-111,9.基金项目
国家自然科学基金(61332009)、国家重点研发计划课题(2016YFB0200501)、国家自然科学基金创新研究群体科学基金(61521092)、北京市科委项目(Z151100003615006)资助项目. （61332009）
