Write in a clean editor, then format for ACM Transactions on Parallel Computing in one click — DocuGuru applies the official ACM template with numbered references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
ACM Transactions on Parallel Computing is a peer-reviewed journal published by ACM, covering Parallel Computing and Optimization Techniques, Distributed systems and fault tolerance, Advanced Data Storage Technologies. Over its lifetime it has published 271 papers, which have received 2,946 citations.
| Publisher | ACM |
|---|---|
| Reference style | Numbered (ACM) Numbered — [1], [2] in the text [1] Ada Smith, Ben Jones, and Cara Lee. 2023. A representative article title. ACM Transactions on Parallel Computing 12, 3, Article 45 (2023).
Formats any DOI in ACM Transactions on Parallel Computing style. No sign-up. |
| Publishes research in | Parallel Computing and Optimization Techniques Distributed systems and fault tolerance Advanced Data Storage Technologies Interconnection Networks and Systems Distributed and Parallel Computing Systems |
| ISSN | 2329-4949 |
| Citation impact (2-yr) | 1.94 |
| h-index | 27 |
| i10-index | 78 |
| Top institutions publishing here | Carnegie Mellon University |
| Journal website | dl.acm.org |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Citations each year’s papers have accumulated so far — the most recent years are still building up.
Greedy algorithms are practitioners’ best friends—they are intuitive, are simple to implement, and often lead to very good solutions. However, implementing greedy algorithms in a distributed setting is challenging since the greedy choice is inherently sequential, and it is not clear how to take advantage of the extra processing power. Our main result is a…
For large-scale graph analytics on the GPU, the irregularity of data access and control flow, and the complexity of programming GPUs, have presented two significant challenges to developing a programmable high-performance graph library. “Gunrock,” our graph-processing system designed specifically for the GPU, uses a high-level, bulk-synchronous, data-centric abstraction focused on operations on a vertex or…
Natural graphs with skewed distributions raise unique challenges to distributed graph computation and partitioning. Existing graph-parallel systems usually use a “one-size-fits-all” design that uniformly processes all vertices, which either suffer from notable load imbalance and high contention for high-degree vertices (e.g., Pregel and GraphLab) or incur high communication cost and memory consumption even for low-degree…
The symmetric sparse matrix-vector multiplication (SymmSpMV) is an important building block for many numerical linear algebra kernel operations or graph traversal applications. Parallelizing SymmSpMV on today’s multicore platforms with up to 100 cores is difficult due to the need to manage conflicting updates on the result vector. Coloring approaches can be used to solve this…
The Message Passing Interface (MPI) 3.0 standard, introduced in September 2012, includes a significant update to the one-sided communication interface, also known as remote memory access (RMA). In particular, the interface has been extended to better support popular one-sided and global-address-space parallel programming models to provide better access to hardware performance features and enable new…
