Although large social and information networks are often thought of as having hierarchical or
tree-like structure, this assumption is rarely tested. We have performed a detailed empirical …

In this work, we show how parallel applications can be implemented efficiently using task
parallelism. We also evaluate the benefits of such parallel paradigm with respect to other …

Recent work has established that large informatics graphs such as social and information
networks have non-trivial tree-like structure when viewed at moderate size scales. Here, we …

The Gromov hyperbolicity is an important parameter for analyzing complex networks which
expresses how the metric structure of a network looks like a tree. It is for instance used to …

With the ever-increasing amount of data and input variations, portable performance is
becoming harder to exploit on today's architectures. Computational setups utilize single-chip …

Graphs provide a general representation or data model for many types of data, where
pairwise relationships are known or thought to be particularly important.∗ Thus, it should not …

This paper presents a high-level C++ framework to explore multi-CPU and multi-GPU
systems called HPSM. HPSM enables execution of parallel loops and reductions …

Dynamic task-based parallelism has become a widely-accepted paradigm in the quest for
exascale computing. In this work, we deliver a non-trivial demonstration of the advantages of …

In the decade since support for task parallelism was incorporated into OpenMP, its use has
remained limited in part due to concerns about its performance and scalability. This paper …

Load balance is an important factor that fundamentally impacts the scalability of any parallel
application. In this paper we present a case study to address a complex load imbalance …