基于长并行距离优先的确定性多线程调度  

Deterministic Multithreaded Scheduling Based on Long Parallel Distance Priority

作　　者：马超[1] 尹杰[1] 江凌波[1] 甄凯[1,2] 

机构地区：[1]清华大学计算机科学与技术系,北京100084 [2]西安电子科技大学软件学院,西安710126

出　　处：《小型微型计算机系统》2012年第10期2177-2181,共5页Journal of Chinese Computer Systems

基　　金：国家"八六三"高技术研究发展计划项目(2011AA01A203)资助

摘　　要：随着多核技术的不断发展,多线程技术更加广泛地应用于计算机软件中.但由于执行的不确定性,多线程程序的排错和调试存在着很大的困难.确定性多线程系统可以使多线程程序以确定的方式执行,即多次执行同一个多线程程序的顺序和结果是相同的,这可以大大简化多线程程序的排错和调试.但是,确定性多线程系统会导致多线程程序性能的下降.本文提出一种基于长并行距离优先的确定性多线程调度算法,优先执行并行距离长的线程,减少线程总体等待时间,从而提高多线程程序的效率.实验结果表明,本文方法可以使多线程程序的性能提升10%,并且具有很好的可扩展性.With the development of the multi-core technique, multithread programming is widely used in the computer software. Because of non-determinism, it is difficult to debug and test multithreaded programs. Deterministic multithreaded systems make a multithreaded program executed in determinate order and hence present the same result at all time, which is of great benefit to debug and test multithreaded programs. However, deterministic multithreaded systems cause performance decrease severely. This paper presents a novel scheduling method for deterministic multithreaded systems based on long parallel distance priority. This approach always chooses the thread that need to execute the longest parallel codes to be scheduled, and thus the total waiting time of all the threads is reduced. Evaluation shows that the performance is improved by 10% and our approach has high scalability.

关 键 词：确定性多线程 长并行距离优先 性能 可扩展性 

分 类 号：TP316[自动化与计算机技术—计算机软件与理论]