检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张婷[1] 李文敬 黄帆[1] ZHANG Ting;LI Wen-jing;HUANG Fan(School of Computer Science and Engineering,Xiangsihu College of Guangxi University for Nationalities,Nanning 530008,China;School of Logistics Management and Engineering,Nanning Normal University,Nanning 530001,China)
机构地区:[1]广西民族大学相思湖学院计算机科学与工程系,广西南宁530008 [2]南宁师范大学物流管理与工程学院,广西南宁530001
出 处:《计算机工程与设计》2020年第12期3419-3424,共6页Computer Engineering and Design
基 金:国家自然科学基金项目(61866006);广西自然科学基金项目(2016GXNSFAA380243);广西创新驱动发展专项资金基金项目(桂科AA17204091);南宁市科学研究与技术开发计划基金项目(20181015-5)。
摘 要:为解决传统的事务内存系统只有对冲突的处理,没有对冲突情况的提前预防,提出一种基于MAP记录表的冲突规避算法,即在事务启动之前,根据历史发生冲突的情况预测其发生冲突的可能性,根据预测结果对事务进行调度,降低事务的失败率。对事务和线程间的读写冲突进行规避,给出并行算法及应用示例。使用高低频区分的方法,将记录表的记录按照冲突频率分别用高频表和低频表维护,便于事务地址的查找。实验结果表明,该算法能较好地体现事务内存冲突规避的实际运行过程,是实现事务内存系统并行控制和运行的有效方法。The traditional transactional memory system can only deal with conflicts without the prevention of conflicts in advance.Thus,a conflict evading algorithm based on MAP log sheet was proposed.Before the transaction started,the possibility of conflict occurrence was predicted in accordance with the historic conflict situations,and the transaction was regulated according to the prediction result,to reduce its failure rate.The evading for the read-write conflict between the transaction and thread was conducted along with the provision of parallel algorithm and application examples.Experimental results show that the proposed algorithm can well reflect the actual operating procedure of the conflict evading of transaction memory,and it is considered effective in realizing the parallel control and operation of the transactional memory system.
关 键 词:多核PC 事务内存 MAP记录表 冲突规避算法 并行处理
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15