一种基于GitHub的分布式力引导算法的设计与实验
A Distributed Force-Directed Algorithm on Giraph: Design and Experiments
摘要：
在本文中，我们研究的问题，设计一个分布式的图形可视化算法的大型图。算法必须易于实现，计算基础设施必须不需要重大的硬件或软件投资。我们设计，实现和实验的力导向算法在Giantics，一个流行的开源框架的分布式计算，基于顶点为中心的设计范式。该算法在真实和人工图上进行了测试，最多有100万条边，使用亚马逊的一个相当便宜的PaaS（平台即服务）基础设施。实验表明，我们的技术相比，集中实施相同的力导向模型的可扩展性和有效性。我们表明，大约有一百万条边的图形可以在不到8分钟的时间内绘制出来，在云计算基础设施中每次绘制花费大约1\$。
英文摘要：
In this paper we study the problem of designing a distributed graph visualization algorithm for large graphs. The algorithm must be simple to implement and the computing infrastructure must 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 million edges, by using a rather inexpensive PaaS (Platform as a Service) infrastructure of Amazon. The experiments show the scalability and effectiveness of our technique when compared to a centralized implementation of the same force-directed model. We show that graphs with about one million edges can be drawn in less than 8 minutes, by spending about 1\$ per drawing in the cloud computing infrastructure.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
