Large-scale neural modeling in MapReduce and Giraph

Shuo Yang, Nicholas D. Spielman, Jadin C. Jackson, Brad S. Rubin
{"title":"Large-scale neural modeling in MapReduce and Giraph","authors":"Shuo Yang, Nicholas D. Spielman, Jadin C. Jackson, Brad S. Rubin","doi":"10.1109/EIT.2014.6871824","DOIUrl":null,"url":null,"abstract":"One of the most crucial challenges in scientific computing is scalability. Hadoop, an open-source implementation of the MapReduce parallel programming model developed by Google, has emerged as a powerful platform for performing large-scale scientific computing at very low costs. In this paper, we explore the use of Hadoop to model large-scale neural networks. A neural network is most naturally modeled by a graph structure with iterative processing. In this paper, we first present an improved graph algorithm design pattern in MapReduce called Mapper-side Schimmy. Experiments show that the application of our design pattern, combined with the current best practices, can reduce the running time of the neural network simulation on a neural network with 100,000 neurons and 2.3 billion edges by 64%. MapReduce, however, is inherently not efficient for iterative graph processing. To address the limitation of the MapReduce model, we then explore the use of Giraph, an open source large-scale graph processing framework that sits on top of Hadoop to implement graph algorithms with a vertex-centric approach. We show that our Giraph implementation boosted performance by 91% compared to a basic MapReduce implementation and by 60% compared to our improved Mapper-side Schimmy algorithm.","PeriodicalId":92209,"journal":{"name":"IEEE International Conference on Electro Information Technology : [proceedings]. IEEE International Conference on Electro Information Technology","volume":"2 1","pages":"556-561"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Conference on Electro Information Technology : [proceedings]. IEEE International Conference on Electro Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EIT.2014.6871824","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

One of the most crucial challenges in scientific computing is scalability. Hadoop, an open-source implementation of the MapReduce parallel programming model developed by Google, has emerged as a powerful platform for performing large-scale scientific computing at very low costs. In this paper, we explore the use of Hadoop to model large-scale neural networks. A neural network is most naturally modeled by a graph structure with iterative processing. In this paper, we first present an improved graph algorithm design pattern in MapReduce called Mapper-side Schimmy. Experiments show that the application of our design pattern, combined with the current best practices, can reduce the running time of the neural network simulation on a neural network with 100,000 neurons and 2.3 billion edges by 64%. MapReduce, however, is inherently not efficient for iterative graph processing. To address the limitation of the MapReduce model, we then explore the use of Giraph, an open source large-scale graph processing framework that sits on top of Hadoop to implement graph algorithms with a vertex-centric approach. We show that our Giraph implementation boosted performance by 91% compared to a basic MapReduce implementation and by 60% compared to our improved Mapper-side Schimmy algorithm.
MapReduce和Giraph中的大规模神经模型
科学计算中最关键的挑战之一是可伸缩性。Hadoop是Google开发的MapReduce并行编程模型的开源实现,它已经成为一个以极低成本执行大规模科学计算的强大平台。在本文中,我们探索了使用Hadoop对大规模神经网络进行建模。神经网络最自然的建模方法是用迭代处理的图结构。在本文中,我们首先在MapReduce中提出了一种改进的图算法设计模式,称为Mapper-side Schimmy。实验表明,应用我们的设计模式,结合目前的最佳实践,可以将具有10万个神经元和23亿个边的神经网络的神经网络仿真运行时间减少64%。然而,对于迭代图处理,MapReduce本质上是不高效的。为了解决MapReduce模型的局限性,我们随后探索了Giraph的使用,这是一个位于Hadoop之上的开源大规模图形处理框架,通过以顶点为中心的方法实现图形算法。我们表明,与基本的MapReduce实现相比,我们的Giraph实现的性能提高了91%,与我们改进的mapper端Schimmy算法相比,性能提高了60%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书