PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Carlini E., Dazzi P., Lulli A., Ricci L. Distributed graph processing: an approach based on overlay composition. In: SAC'16 - 31st Annual ACM Symposium on Applied Computing (Pisa, Italy, 4-8 April 2016). Proceedings, pp. 1912 - 1917. ACM, 2016.
 
 
Abstract
(English)
In this day and age, human being is generating an unprece- dented amount of data coming from multiple and hetero- geneous sources, ranging from scientific devices to business transactions. In many contexts such data is modelled as a graph, however, due to its size, it is often infeasible to process it on a single machine. As a consequence, the adop- tion of parallel and distributed computing frameworks is the natural approach to face this problem. This paper proposes an high-level approach for large graphs processing. Our ap- proach takes inspiration from overlay networks, a widely ex- ploited approach for information dissemination, aggregation and computing orchestration in highly distributed systems. We propose Telos, a programming framework supporting the definition of computations on graphs as a composition of overlays, each devoted to a specific aim. Telos is imple- mented on the top of Apache Spark. A set of experimental results are presented to give a preliminary evidence of the effectiveness of our approach.
URL: http://dl.acm.org/citation.cfm?doid=2851613.2851746
DOI: 10.1145/2851613.2851746
Subject Distributed Systems
Graphs
Protocols
Network
D.1.3 PROGRAMMING TECHNIQUES. Concurrent programming


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional