2 Search Results for "Peri, Sathya"


Document
Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds

Authors: Bapi Chatterjee, Sathya Peri, Muktikanta Sa, and Komma Manogna

Published in: LIPIcs, Volume 217, 25th International Conference on Principles of Distributed Systems (OPODIS 2021)


Abstract
Today’s graph-based analytics tasks in domains such as blockchains, social networks, biological networks, and several others demand real-time data updates at high speed. The real-time updates are efficiently ingested if the data structure naturally supports dynamic addition and removal of both edges and vertices. These dynamic updates are best facilitated by concurrency in the underlying data structure. Unfortunately, the existing dynamic graph frameworks broadly refurbish the static processing models using approaches such as versioning and incremental computation. Consequently, they carry their original design traits such as high memory footprint and batch processing that do not honor the real-time changes. At the same time, multi-core processors-a natural setting for concurrent data structures-are now commonplace, and the analytics tasks are moving closer to data sources over lightweight devices. Thus, exploring a fresh design approach for real-time graph analytics is significant. This paper reports a novel concurrent graph data structure that provides breadth-first search, single-source shortest-path, and betweenness centrality with concurrent dynamic updates of both edges and vertices. We evaluate the proposed data structure theoretically - by an amortized analysis - and experimentally via a C++ implementation. The experimental results show that (a) our algorithm outperforms the current state-of-the-art by a throughput speed-up of up to three orders of magnitude in several cases, and (b) it offers up to 80x lighter memory-footprint compared to existing methods. The experiments include several counterparts: Stinger, Ligra and GraphOne. We prove that the presented concurrent algorithms are non-blocking and linearizable.

Cite as

Bapi Chatterjee, Sathya Peri, Muktikanta Sa, and Komma Manogna. Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 20:1-20:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)


Copy BibTex To Clipboard

@InProceedings{chatterjee_et_al:LIPIcs.OPODIS.2021.20,
  author =	{Chatterjee, Bapi and Peri, Sathya and Sa, Muktikanta and Manogna, Komma},
  title =	{{Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds}},
  booktitle =	{25th International Conference on Principles of Distributed Systems (OPODIS 2021)},
  pages =	{20:1--20:25},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-219-8},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{217},
  editor =	{Bramas, Quentin and Gramoli, Vincent and Milani, Alessia},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.20},
  URN =		{urn:nbn:de:0030-drops-157952},
  doi =		{10.4230/LIPIcs.OPODIS.2021.20},
  annote =	{Keywords: concurrent data structure, linearizability, non-blocking, directed graph, breadth-first search, single-source shortest-path, betweenness centrality}
}
Document
Brief Announcement
Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds

Authors: Bapi Chatterjee, Sathya Peri, and Muktikanta Sa

Published in: LIPIcs, Volume 209, 35th International Symposium on Distributed Computing (DISC 2021)


Abstract
This paper reports a new concurrent graph data structure that supports updates of both edges and vertices and queries: Breadth-first search, Single-source shortest-path, and Betweenness centrality. The operations are provably linearizable and non-blocking.

Cite as

Bapi Chatterjee, Sathya Peri, and Muktikanta Sa. Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds. In 35th International Symposium on Distributed Computing (DISC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 209, pp. 52:1-52:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)


Copy BibTex To Clipboard

@InProceedings{chatterjee_et_al:LIPIcs.DISC.2021.52,
  author =	{Chatterjee, Bapi and Peri, Sathya and Sa, Muktikanta},
  title =	{{Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds}},
  booktitle =	{35th International Symposium on Distributed Computing (DISC 2021)},
  pages =	{52:1--52:4},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-210-5},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{209},
  editor =	{Gilbert, Seth},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.52},
  URN =		{urn:nbn:de:0030-drops-148549},
  doi =		{10.4230/LIPIcs.DISC.2021.52},
  annote =	{Keywords: concurrent data structure, linearizability, non-blocking, directed graph, breadth-first search, single-source shortest-path, betweenness centrality}
}
  • Refine by Author
  • 2 Chatterjee, Bapi
  • 2 Peri, Sathya
  • 2 Sa, Muktikanta
  • 1 Manogna, Komma

  • Refine by Classification
  • 2 Theory of computation → Concurrent algorithms

  • Refine by Keyword
  • 2 betweenness centrality
  • 2 breadth-first search
  • 2 concurrent data structure
  • 2 directed graph
  • 2 linearizability
  • Show More...

  • Refine by Type
  • 2 document

  • Refine by Publication Year
  • 1 2021
  • 1 2022