Tree-based data structures are ubiquitous across applications. Therefore, a multitude of different tree implementations exist. However, while these implementations are diverse, they share a tree structure as the underlying data structure. As such, the access patterns inside these trees are very similar, following a path from the root of the tree towards a leaf node. Similarly, many distinct types of memory exist. These types of memory all have different characteristics. Some of these have an impact on the overall system performance. While the concrete types of memory are varied, their characteristics can often be abstracted to have a similar effect on the performance. We show how the characteristics of different types of memories can be used to improve the performance of tree-based data structures. By reordering the nodes of a tree inside memory, the characteristics of memory can be exploited to optimize the performance. To this end, this paper presents different strategies for reordering nodes inside memory as well as efficient algorithms for realizing these strategies. It additionally provides strategies to decide when such a reordering operation should be triggered during operation. Further, this paper conducts experiments showing the performance impact of the proposed strategies. The experiments show that the strategies can improve the performance of trees by up to 95\% as offline optimization and 75\% as online optimization.
Trinity College Dublin, The University of Dublin(都柏林大学圣三一学院);The School of Computer Science and Statistics(计算机科学与统计学院);Institute of Technology Carlow(卡洛理工学院)
A Memory-Efficient FM-Index Constructor for Next-Generation Sequencing Applications on FPGAs
FM-索引是用于字符串搜索的有效数据结构,并且广泛用于下一代测序(NGS)应用,例如序列比对和从头组装。最近,FM索引甚至被执行到读取级别,提高了对FM索引构建的有效算法的需求。在这项工作中,我们提出了一个硬件兼容的自辅助增量索引(SAII)算法和它的硬件架构。该算法在建立FM索引时不需要占用内存,而且实现算法的硬件系统非常紧凑。为了提高计算效率,设计了并行结构和专用的预取控制器。基于SAII的FM索引构造器在Altera Stratix V FPGA板上实现。所呈现的构造器可以支持大小高达131,072-bp的DNA序列,这对于从当前主要平台获得的小规模参考和读取是足够的。由于所提出的构造器需要很少的硬件资源,它可以很容易地集成到不同的硬件加速器设计的FM索引为基础的应用程序。
GFormer: Accelerating Large Language Models with Optimized Transformers on Gaudi Processors
University of Houston(休斯顿大学);Indiana University(印第安纳大学);Stevens Institute of Technology(史蒂文斯理工学院);Argonne National Laboratory(阿贡国家实验室);Binghamton University(宾汉姆顿大学)