“…Blelloch [1] first introduced scan as a fundamental primitive and discussed its possible applications [2].Later on, more and more parallel applications of scan emerged, such as sort [6,7,8,9,10,11], BFS [12,13], SpMV [13,14], parallel compaction [15],minimal spanning tree [16] and linked list prefix computations [17], etc. The (inclusive) scan problem is defined as follows: Given a sequence with n input elements: ] , ,..., , [ The ⊕ symbol denotes a binary reduction operator, which satisfies the associative law and commutative law.…”