Processing a one trillion-edge graph has recently been demonstrated by distributed graph engines running on clusters of tens to hundreds of nodes. In this paper, we employ a single …
C De Sa, M Feldman, C Ré, K Olukotun - Proceedings of the 44th annual …, 2017 - dl.acm.org
Stochastic gradient descent (SGD) is one of the most popular numerical algorithms used in machine learning and other domains. Since this is likely to continue for the foreseeable …
We reduce the cost of communication and synchronization in graph processing by analyzing the fastest way to process graphs: pushing the updates to a shared state or pulling the …
M Shen, B Ma, L Zhu, R Mijumbi… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
Constrained shortest distance (CSD) querying is one of the fundamental graph query primitives, which finds the shortest distance from an origin to a destination in a graph with a …
Y Shan, SY Tsai, Y Zhang - Proceedings of the 2017 Symposium on …, 2017 - dl.acm.org
Next-generation non-volatile memories (NVMs) will provide byte addressability, persistence, high density, and DRAM-like performance. They have the potential to benefit many …
This paper explores how fork-join parallelism, as supported by concurrency platforms such as Cilk and OpenMP, can be embedded into a compiler's intermediate representation (IR) …
In the past decade, the smart phone evolution has accelerated the proliferation of the mobile Internet and spurred a new wave of mobile applications, leading to an unprecedented …
Due to the growing need to process large graph and network datasets created by modern applications, recent years have witnessed a surging interest in developing big graph …
A Saboury, P Musavi, F Khomh… - 2017 IEEE 24th …, 2017 - ieeexplore.ieee.org
JavaScript is a powerful scripting programming language that has gained a lot of attention this past decade. Initially used exclusively for client-side web development, it has evolved to …