A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries-Reference-Cited by-同舟云学术

A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries

Published:2019-01-04 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 20th International Conference on Distributed Computing and Networking
language:
Short-container-title:

Author:

Chatterjee Bapi¹,Peri Sathya²,Sa Muktikanta²,Singhal Nandini³

Affiliation:

1. Institute of Science and Technology, Austria

2. Indian Institute of Technology Hyderabad, India

3. Microsoft (R&D) Pvt. Ltd., Bangalore, India

Funder

MediaLab Asia

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3288599.3288617

Reference9 articles.

1. Atomic snapshots of shared memory

2. Bapi Chatterjee Sathya Peri Muktikanta Sa and Nandini Singhal. 2017. ConcurrentGraphDS. https://github.com/PDCRL/ConcurrentGraphDS. Bapi Chatterjee Sathya Peri Muktikanta Sa and Nandini Singhal. 2017. ConcurrentGraphDS. https://github.com/PDCRL/ConcurrentGraphDS.

3. Thomas H Cormen Charles E Leiserson Ronald L Rivest and Clifford Stein. 2009. Introduction to algorithms. MIT press. Thomas H Cormen Charles E Leiserson Ronald L Rivest and Clifford Stein. 2009. Introduction to algorithms . MIT press.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Concurrent Lock-Free Dynamic Graphs with wait-free snapshots using versioning;Proceedings of the 25th International Conference on Distributed Computing and Networking;2024-01-04

2. OptSmart: a space efficient Optimistic concurrent execution of Smart contracts;Distributed and Parallel Databases;2022-05-09

3. Efficient parallel execution of block transactions in blockchain;Proceedings of the 22nd International Middleware Conference: Doctoral Symposium;2021-12-06

4. A Scalable Concurrent Algorithm for Dynamic Connectivity;Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures;2021-07-06

5. Non-blocking interpolation search trees with doubly-logarithmic running time;Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming;2020-02-19