|
|||||
|
|
| 公平性考虑的短作业优先内存调度策略 | |
| 引用本文： | 金瑛棋,吴俊敏,赵小雨.公平性考虑的短作业优先内存调度策略[J].计算机工程,2012,38(20):243-246. |
| 作者姓名： | 金瑛棋 吴俊敏 赵小雨 |
| 作者单位： | 1. 中国科学技术大学计算机科学与技术学院,合肥,230027 2. 中国科学技术大学计算机科学与技术学院,合肥230027;中国科学技术大学苏州研究院,江苏苏州215123 3. 中国科学技术大学苏州研究院,江苏苏州,215123 |
| 基金项目： | 中央高校基本科研业务费专项基金资助项目(WK0110000020) |
| 摘 要： | 针对片上多核平台下多线程访问共享内存资源的不公平性、低效性问题,提出公平性考虑的短作业优先内存调度策略,采用设置请求最大等待时间保证线程访问公平性,短作业优先策略缩小请求平均等待时间,关注线程本身固有的并行性.实验结果证明,该策略在多线程访问时IPC性能提升明显,最高性能提升达到43％. |
| 关 键 词： | 多核 多线程 共享内存 公平性 短作业优先 并行性 |
| 收稿时间： | 2011-12-15 |
| 修稿时间： | 2012-02-23 |
Fairness-considered Shortest Job First Strategy for Memory Scheduling |
|
| JIN Ying-qi , WU Jun-min , ZHAO Xiao-yu.Fairness-considered Shortest Job First Strategy for Memory Scheduling[J].Computer Engineering,2012,38(20):243-246. | |
| Authors: | JIN Ying-qi WU Jun-min ZHAO Xiao-yu |
| Affiliation: | 1.School of Computer Science and Technology,University of Science and Technology of China,Hefei 230027,China;2.Suzhou Institute for Advanced Study,University of Science and Technology of China,Suzhou 215123,China) |
| Abstract: | 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%. |
| Keywords: | multi-core multi-thread shared memory fairness shortest job first parallelism |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |
| 点击此处可从《计算机工程》浏览原始摘要信息 | |
| 点击此处可从《计算机工程》下载全文 | |