Large graph visualizations using a distributed computing platform

详细信息    查看全文

• 作者：Alessio Arleo ^{alessio.arleo@studenti.unipg.it} ; Walter Didimo ; ^{walter.didimo@unipg.it} ; Giuseppe Liotta ^{giuseppe.liotta@unipg.it} ; Fabrizio Montecchiani ^{fabrizio.montecchiani@unipg.it}
• 关键词：Large graphs ; Network visualization ; Force-directed techniques ; Distributed algorithms ; Giraph ; Big data ; Cloud computing
• 刊名：Information Sciences
• 出版年：2017
• 出版时间：March 2017
• 年：2017
• 卷：381
• 期：Complete
• 页码：124-141
• 全文大小：3327 K
• 卷排序：381

文摘

Big Data analytics is recognized as one of the major issues in our current information society, and raises several challenges and opportunities in many fields, including economy and finance, e-commerce, public health and administration, national security, and scientific research. The use of visualization techniques to make sense of large volumes of information is an essential ingredient, especially for the analysis of complex interrelated data, which are represented as graphs. The growing availability of powerful and inexpensive cloud computing services naturally motivates the study of distributed graph visualization algorithms, able to scale to the size of large graphs. We study the problem of designing a distributed visualization algorithm that must be simple to implement and whose computing infrastructure does not require major hardware or software investments. We design, implement, and experiment a force-directed algorithm in Giraph, a popular open source framework for distributed computing, based on a vertex-centric design paradigm. The algorithm is tested both on real and artificial graphs with up to one million edges. The experiments show the scalability and effectiveness of our technique when compared to a centralized implementation of the same force-directed model. Graphs with about one million edges can be drawn in a few minutes, by spending about 1 USD per drawing with a cloud computing infrastructure of Amazon.