We present the results obtained by using an evolution of our CUDA-based solution for the
exploration, via a breadth first search, of large graphs. This latest version exploits at its best …

The binary-forking model is a parallel computation model, formally defined by Blelloch et al.,
in which a thread can fork a concurrent child thread, recursively and asynchronously. The …

The breadth‐first search procedure is an algorithm that traverses the vertices of a graph,
determining the distance from each vertex to the initial vertex. The distance is infinite for a …

Since the beginning of the last decade, plateauing of the clock speed of computer
processors has forced us to invest more in parallelism—for both hardware and software …

工作负载分配不均是制约众核密码平台资源利用率提高的重要因素, 动态负载分配可提高平台
资源利用率, 但具有一定开销; 所以更高的负载均衡频率并不一定带来更高的负载均衡增益 …

The binary-forking model is a parallel computation model, formally defined by Blelloch et al.
very recently, in which a thread can fork a concurrent child thread, recursively and …

Common many-core processors contain tens of cores and distributed memory. Compared to
a multicore system, which only has a few tightly coupled cores sharing a single bus and …

Neste artigo, são mostrados resultados de uma re-implementação da busca em largura na
linguagem C++ com estrutura bag e interface OpenMP. A implementação é baseada em …

It is hard to reason about the state of a multicore system-on-chip, because operations on
memory need multiple cycles to complete, since cores communicate via an interconnect like …

Imbalanced workload distribution results in low resource utilization of many-core crypto-
platform. Dynamic workload allocation can improve the resource utilization with some …