DyAdHyTM:一种低开销的大数据图动态自适应混合存储器
DyAdHyTM: A Low Overhead Dynamically Adaptive Hybrid Transactional Memory on Big Data Graphs
摘要:
大数据是一个流行词,用于描述大量数据,这些数据提供了通过数据分析探索新见解的机会。然而,大数据大多是结构化的,但可以是半结构化或非结构化的。它通常是如此之大,以至于使用传统的计算系统处理它不仅困难而且缓慢。解决方案之一是将数据格式化为图形数据结构,并在共享内存架构上处理它们,以使用快速和新颖的策略,例如事务内存。在生物信息学、社交网络和网络安全等大数据类型问题中的大多数图形应用中,图形本质上是稀疏的。由于这种稀疏性,我们有机会使用Transmitted Memory(TM)作为关键部分的同步策略,以加速应用程序。在低冲突概率TM执行优于大多数同步策略,由于其固有的非阻塞特性。TM可以用软件、硬件或两者的组合来实现。然而,硬件TM实现是快速的,但受限于稀缺的硬件资源,而软件实现具有高的开销,这会降低性能。在本文中,我们开发了一个低开销,但简单,动态自适应(即在运行时)的混合(即结合硬件和软件)TM(DyAdHyTM)计划,结合了硬件TM(HTM)和软件TM(STM)的最佳功能,同时适应应用程序的要求。对于在具有大共享内存的多核机器上运行的SSCA2图形基准测试,它的性能比粗粒度锁高出8.12倍,比低开销STM高出2.68倍,比HTM的几个实现高出2.59倍,比其他HyTM高出1.55倍。
英文摘要:
Big data is a buzzword used to describe massive volumes of data that provides opportunities of exploring new insights through data analytics. However, big data is mostly structured but can be semi-structured or unstructured. It is normally so large that it is not only difficult but also slow to process using traditional computing systems. One of the solutions is to format the data as graph data structures and process them on shared memory architecture to use fast and novel policies such as transactional memory. In most graph applications in big data type problems such as bioinformatics, social networks, and cyber security, graphs are sparse in nature. Due to this sparsity, we have the opportunity to use Transactional Memory (TM) as the synchronization policy for critical sections to speedup applications. At low conflict probability TM performs better than most synchronization policies due to its inherent non-blocking characteristics. TM can be implemented in Software, Hardware or a combination of both. However, hardware TM implementations are fast but limited by scarce hardware resources while software implementations have high overheads which can degrade performance. In this paper, we develop a low overhead, yet simple, dynamically adaptive (i.e. at runtime) hybrid (i.e. combines hardware and software) TM (DyAdHyTM) scheme that combines the best features of both Hardware TM (HTM) and Software TM (STM) while adapting to application requirements. It performs better than coarse grain lock by up to 8.12x, a low overhead STM by up to 2.68x, a couple of implementations of HTMs (by up to 2.59x), and other HyTMs (by up to 1.55x) for SSCA2 graph benchmark running on a multicore machine with a large shared memory.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。