公平性考虑的短作业优先内存调度策略

摘要

It is unfair, ineffective to access shared memory for multi-thread on the chip of multi-core. This paper proposes fairness-aware shortest job first scheduling which sets request for the maximun waiting time to guarantee fairness, uses shortest job first priority to cut down the average waiting time, pays attention to parallelism of threads to solve above problems. Experimental result shows that this method improves IPC performance in multi-thread visit, and the highest performance improvement can reach 43%.%针对片上多核平台下多线程访问共享内存资源的不公平性、低效性问题,提出公平性考虑的短作业优先内存调度策略,采用设置请求最大等待时间保证线程访问公平性,短作业优先策略缩小请求平均等待时间,关注线程本身固有的并行性.实验结果证明,该策略在多线程访问时IPC性能提升明显,最高性能提升达到43％.