Abstract The PVM system is a programming environment for the development and execution of large concurrent or parallel applications that consist of many interacting, but relatively independent, components. It is intended to operate on a collection of heterogeneous computing elements interconnected by one or more networks. The participating processors may be scalar machines, multiprocessors, or…
Concurrency Practice and Experience Template
Write in a clean editor, then format for Concurrency Practice and Experience in one click — DocuGuru applies the official Wiley template with author–year references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
About the Concurrency Practice and Experience format
Concurrency Practice and Experience is a peer-reviewed journal published by Wiley, covering Parallel Computing and Optimization Techniques, Distributed and Parallel Computing Systems, Distributed systems and fault tolerance.
| Publisher | Wiley |
|---|---|
| Reference style | Author–year (Chicago) Author–year — (Smith, 2023) in the text Smith, Ada, Ben Jones, and Cara Lee. 2023. "A Representative Article Title." Concurrency Practice and Experience 12 (3): 45–58.
Formats any DOI in Concurrency Practice and Experience style. No sign-up. |
| Publishes research in | Parallel Computing and Optimization Techniques Distributed and Parallel Computing Systems Distributed systems and fault tolerance Advanced Data Storage Technologies Interconnection Networks and Systems |
| ISSN | 1040-3108 |
| h-index | 51 |
| i10-index | 232 |
| Total citations | 12,835 |
| Top institutions publishing here | Syracuse University |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Papers published in Concurrency Practice and Experience per year
Citation impact of Concurrency Practice and Experience by publication year
Citations each year’s papers have accumulated so far — the most recent years are still building up.
Most-cited papers in Concurrency Practice and Experience
In the paper we give a straightforward, highly efficient, scalable implementation of common matrix multiplication operations. The algorithms are much simpler than previously published methods, yield better performance, and require less work space. MPI implementations are given, as are performance results on the Intel Paragon system. © 1997 by John Wiley & Sons, Ltd.
Abstract If problems involving unstructured meshes are to be solved efficiently on distributed‐memory parallel computers, the meshes must be partitioned and distributed across processors in a way that balances the computational load and minimizes communication. The recursive spectral bisection method (RSB) has been shown to be very effective for such partitioning problems compared to alternative…
Titanium is a language and system for high-performance parallel scientific computing. Titanium uses Java as its base, thereby leveraging the advantages of that language and allowing us to focus attention on parallel computing issues. The main additions to Java are immutable classes, multidimensional arrays, an explicitly parallel SPMD model of computation with a global address…
Java's threads offer appropriate means either for parallel programming of SMPs or as target constructs when compiling add-on features (e.g. forall constructs, automatic parallelization, etc.) Unfortunately, Java does not provide elegant and straightforward mechanisms for parallel programming on distributed memory machines, like clusters of workstations. JavaParty transparently adds remote objects to Java purely by declaration…