Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJuly 2021
Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths
SPAA '21: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and ArchitecturesPages 184–197https://doi.org/10.1145/3409964.3461782The single-source shortest-path (SSSP) problem is a notoriously hard problem in the parallel context. In practice, the Δ-stepping algorithm of Meyer and Sanders has been widely adopted. However, Δ-stepping has no known worst-case bounds for general ...
- extended-abstractJuly 2020
ParlayLib - A Toolkit for Parallel Algorithms on Shared-Memory Multicore Machines
SPAA '20: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and ArchitecturesPages 507–509https://doi.org/10.1145/3350755.3400254ParlayLib is a C++ library for developing efficient parallel algorithms and software on shared-memory multicore machines. It provides additional tools and primitives that go beyond what is available in the C++ standard library, and simplifies the task ...
- articleNovember 2000
Asynchronous group mutual exclusion
Mutual exclusion and concurrency are two fundamental and essentially opposite features in distributed systems. However, in some applications such as Computer Supported Cooperative Work (CSCW) we have found it necessary to impose mutual exclusion on ...
- articleMay 1999
Time-Lapse Snapshots
SIAM Journal on Computing (SICOMP), Volume 28, Issue 5Pages 1848–1874https://doi.org/10.1137/S0097539793243685A snapshot scan algorithm produces an "instantaneous" picture of a region of shared memory that may be updated by concurrent processes. Many complex shared memory algorithms can be greatly simplified by structuring them around the snapshot scan ...
- articleJuly 1996
Fast timing-based algorithms
Concurrent systems in which there is a known upper bound Δ on memory access time are considered. Two prototypical synchronization problems, mutual exclusion and consensus, are studied, and solutions that have constant (i.e. independent of Δ and the ...
- ArticleOctober 1989
Polynomial end-to-end communication
SFCS '89: Proceedings of the 30th Annual Symposium on Foundations of Computer SciencePages 358–363https://doi.org/10.1109/SFCS.1989.63503A dynamic communication network is one in which links may repeatedly fail and recover. In such a network, although it is impossible to establish a path of unfailed links, reliable communication is possible if there is no cut of permanently failed links ...
