arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1807.01624cs.PL
收藏

简单:指令级和存储级并行性

Cimple: Instruction and Memory Level Parallelism

Vladimir Kiriansky, Haoran Xu, Martin Rinard, Saman Amarasinghe

摘要:

现代乱序处理器已经增加了利用指令级并行(ILP)和存储器级并行(MLP)的能力,例如,通过使用宽超标量流水线和向量执行单元,以及用于飞行中的存储器请求的深缓冲区。然而,这些资源通常在具有大工作集的工作负载上表现出较差的利用率,例如,内存数据库、键值存储和图形分析,因为编译器和硬件努力从指令流自动公开ILP和MLP。本文介绍了IMLP(指令和存储器级并行)任务编程模型。IMLP任务作为协同程序执行,协同程序在带注释的长延迟操作处产生执行,例如,存储器访问、分割或不可预测的分支。IMLP任务在单个线程上交错,并与线程并行和向量化很好地集成。我们的DSL嵌入在C++中,Cimple,允许探索任务调度和转换,如缓冲,矢量化,流水线和预取。我们展示了在内存数据库中使用的核心算法的最先进的性能,这些算法对数组、哈希表、树和跳表进行操作。简单的应用程序达到2.5倍的吞吐量增益超过硬件多线程的多核,和6.4倍的单线程加速。

英文摘要:

Modern out-of-order processors have increased capacity to exploit instruction level parallelism (ILP) and memory level parallelism (MLP), e.g., by using wide superscalar pipelines and vector execution units, as well as deep buffers for in-flight memory requests. These resources, however, often exhibit poor utilization rates on workloads with large working sets, e.g., in-memory databases, key-value stores, and graph analytics, as compilers and hardware struggle to expose ILP and MLP from the instruction stream automatically. In this paper, we introduce the IMLP (Instruction and Memory Level Parallelism) task programming model. IMLP tasks execute as coroutines that yield execution at annotated long-latency operations, e.g., memory accesses, divisions, or unpredictable branches. IMLP tasks are interleaved on a single thread, and integrate well with thread parallelism and vectorization. Our DSL embedded in C++, Cimple, allows exploration of task scheduling and transformations, such as buffering, vectorization, pipelining, and prefetching. We demonstrate state-of-the-art performance on core algorithms used in in-memory databases that operate on arrays, hash tables, trees, and skip lists. Cimple applications reach 2.5x throughput gains over hardware multithreading on a multi-core, and 6.4x single thread speedup.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑