A Transactional Model for Parallel Programming of Graph Applications on Computing Clusters

Loading...

View/Download File

IEEE-CLOUD-2017.pdf (167.14 KB)

Persistent link to this item

https://hdl.handle.net/11299/200943

Statistics

View Statistics

Journal Title

Journal ISSN

Volume Title

Title

A Transactional Model for Parallel Programming of Graph Applications on Computing Clusters

Authors

Tripathi, Anand

Padhye, Vinit

Sunkara, Tara Sasank

Tucker, Jeremy

Thirunavukarasu, BhagavathiDhass

Pandey, Varun

Sharma, Rahul R.

Published Date

2017

Publisher

IEEE

Type

Conference Paper

Abstract

We present here the results of our investigation of a transactional model of parallel programming on cluster computing systems. This model is specifically targeted for graph applications with the goal of harnessing unstructured parallelism inherently present in many such problems. In this model, tasks for vertex-centric computations are executed optimistically in parallel as serializable transactions. A key-value based globally shared object store is implemented in the main memory of the cluster nodes for storing the graph data. Task computations read and modify data in the distributed global store, without any explicitly programmed message-passing in the application code. Based on this model we developed a framework for parallel programming of graph applications on computing clusters. We present here the programming abstractions provided by this framework and its architecture. Using several graph problems we illustrate the simplicity of the abstractions provided by this model. These problems include graph coloring, k-nearest neighbors, and single-source shortest path computation. We also illustrate how incremental computations can be supported by this programming model. Using these problems we evaluate the transactional programming model and the mechanisms provided by this framework.

Keywords

Parallel programming

Concurrency Control

Cluster Computing

Database Transactions

Graph Algorithms

Description

This paper describes the transactio-based parallel computing model of a cluster-based parallel programming framework called Beehive. The codebase of this framework is available at http://ajanta.cs.umn.edu for research and education.

Related to

Replaces

License

Collections

Articles and Scholarly Works

Series/Report Number

IEEE International Conference on Cloud Computing;

Funding information

National Science Foundation

Isbn identifier

Doi identifier

10.1109/CLOUD.2017.62

Previously Published Citation

A. Tripathi and V. Padhye and T. S. Sunkara and J. Tucker and B. Thirunavukarasu and V. Pandey and R. R. Sharma, "A Transactional Model for Parallel Programming of Graph Applications on Computing Clusters," 2017 IEEE 10th International Conference on Cloud Computing (CLOUD), DOI: 10.1109/CLOUD.2017.62

Suggested citation

Tripathi, Anand; Padhye, Vinit; Sunkara, Tara Sasank; Tucker, Jeremy; Thirunavukarasu, BhagavathiDhass; Pandey, Varun; Sharma, Rahul R.. (2017). A Transactional Model for Parallel Programming of Graph Applications on Computing Clusters. Retrieved from the University Digital Conservancy, 10.1109/CLOUD.2017.62.

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.