Implementing graph representation model for parallel and distributed systems using Erlang

Iurii Petrov

Abstract


This paper describes a new model of graph representation using the Erlang actor model. Benefits of using lightweight processes instead of traditional passive data structures are given. Examples of using this model are shown. The experimental part gives two examples of using early implementations of the offered model. As a conclusion, an analysis of applicability for tasks from different branches of science is given.

Keywords


graphs representation; parallel systems; distributed systems; clusters; Erlang

Full Text:

PDF

References


Cesarini F., Thompson S.: Erlang Programming. DMK, Moscow, 2012.

Compeau P., Pevzner P., Tesler G.: How to apply de Bruijn graphs to genome assembly. Nature Biotechnology, vol. 29, pp. 987–991, 2011.

Gergel V.P.: Theory and Practice of Parallel Computing. BINOM, Moscow, 2007.

Gonzalez J., Low Y., Gu H., Brikson D., Guestrin C.: PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs, http://www.eecs.harvard.edu/cs261/papers/gonzalez-2012.pdf.

Homolog.us – bioinformatics: Why use de Bruijn Graphs for Genome Assembly? http://www.homolog.us/Tutorials/index.php?p=1.4&s=1.

Ovchinnikov V., Ivanova G., Nichushkina T.: Selection of Data Structures for Graph Representantion while Solving Combinatoril and Optimisational Problems. Herald of the Bauman Moscow State Technical University. Instrument Engineering, vol. 2 (43), pp. 39–51, 2001.

Ovchinnikov V.A.: Algorithmization of Combinatory-Opimizational Tasks in Constructing Computing Systems. Publishing house of Bauman Moscow State Technical University, Moscow, 2001.

Yakobovskiy M.: Introduction to the Parallel Methods of Problem Solving. Publishing house of Moscow State University, Moscow, 2013.




DOI: https://doi.org/10.7494/csci.2016.17.1.99

Refbacks

  • There are currently no refbacks.