期刊文献+

公平性考虑的短作业优先内存调度策略 被引量:4

Fairness-considered Shortest Job First Strategy for Memory Scheduling
下载PDF
导出
摘要 针对片上多核平台下多线程访问共享内存资源的不公平性、低效性问题,提出公平性考虑的短作业优先内存调度策略,采用设置请求最大等待时间保证线程访问公平性,短作业优先策略缩小请求平均等待时间,关注线程本身固有的并行性。实验结果证明,该策略在多线程访问时IPC性能提升明显,最高性能提升达到43%。 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%.
出处 《计算机工程》 CAS CSCD 2012年第20期243-246,共4页 Computer Engineering
基金 中央高校基本科研业务费专项基金资助项目(WK0110000020)
关键词 多核 多线程 共享内存 公平性 短作业优先 并行性 multi-core multi-thread shared memory fairness shortest job first parallelism
  • 相关文献

参考文献5

  • 1隋秀峰,陈国良,吴俊敏.高性能微处理器中自适应高速缓存管理策略研究[D].合肥:中国科学技术大学,2010.
  • 2Stallings W. 计算机组成与体系结构性能设计[M]. 彭蔓蔓, 吴 强, 任小西, 译. 北京: 机械工业出版社, 2011.
  • 3Mutlu O, Moscibroda T. Parallelism-aware Batch Scheduling: Enhancing Both Performance and Fairness of Shared DRAM Systems[C] //Proc. of International Symposium on Computer Architecture. Beijing, China: [s. n.] , 2008.
  • 4Mutlu O, Moscibroda T. Stall-time Fair Memory Access Scheduling for Chip Multiprocessors[C] //Proc. of International Symposium on Microarchitecture. Chicago, USA: [s. n.] , 2007.
  • 5Hennessy J L, Patterson D A. 计算机系统结构——量化研究方法[M]. 白跃彬, 译. 4版. 北京: 电子工业出版社, 2007.

共引文献1

同被引文献35

  • 1金宏,王宏安,傅勇,王强,王晖.模糊反馈控制实时调度算法[J].软件学报,2004,15(6):791-798. 被引量:13
  • 2涂刚,阳富民,卢炎生.基于动态优先级策略的最优软非周期任务调度算法[J].计算机研究与发展,2004,41(11):2026-2034. 被引量:20
  • 3李建国,陈松乔,鲁志辉.实时异构系统的动态分批优化调度算法[J].计算机学报,2006,29(6):976-984. 被引量:13
  • 4Tanenbaum A S. Modem operating systems. Prentice Hall Press 2007.
  • 5Boyd-Wickizer S, Chen H, Chen R, et al. Corey: an operating sys- tem for many cores. OSDI, 2008.
  • 6Sohesz S, Ptzl H, Fiuczynski M E, et al. Container-based operating system virtualization: a scalable, high-performance alternative to hy- pervisors. ACM SIGOPS Operating Systems Review, ACM, 2007.
  • 7Sharma R, Soni V K, Mishra M K, et al. An agent based dynamic resource scheduling model with FCFS-Job grouping strategy in grid computing. International Conference on Cluster and Grid Computing Systems (ICCGCS-2010) , Italy, Rome 2010.
  • 8Adan I, Weiss G. Exact FCFS matching rates for two infinite multi- type sequences. Operations Research, 2012, 60(2) : 475-489.
  • 9Parvar M R E, Parvar M E, Safari S. A starvation free IMLFQ sched- uling algorithm based on neural network. International Journal of Computational Intelligence Research, 2008, 4 (1) :27-36.
  • 10Hoganson K. Reducing MLFQ scheduling starvation with feedback and exponential averaging. Journal of Computing Sciences in Colle- ges, 2009, 25(2) : 196-202.

引证文献4

二级引证文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部