PARDA: A Fast Parallel Reuse Distance Analysis Algorithm

SHARDS 基于 PARDA 实现，我比较好奇对 MRC generation 并行计算该怎么做，并且我不知道这个并行优化后的结果和 OSCA 哪个更好。

Abstract

parallel algorithm to compute accurate reuse distances

Introduction

Background: Reuse Distance

Sequential Reuse Distance Analysis

PARDA algorithm: np steps where each process processes its chunk of the trace and then sends its local infinities to its left neighbor.

复杂度分析暂略