원문정보
보안공학연구지원센터(IJDTA)
International Journal of Database Theory and Application
Vol.8 No.3
2015.06
pp.77-84
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
Massive scientific computations such as matrix, graph and network algorithms are very attractive when they come to modelling real-world data. Apache Hama is a pure BSP (Bulk Synchronous Parallel) distributed computing framework for massive scientific computations. In this paper, our experiments were conducted on a 4-node Hadoop cluster. We implement Monte Carlo algorithm of Pi in Hama and Hadoop under the same software and hardware environment. The experimental results show that Hama can achieve much higher performance than Hadoop in our testbed.
목차
Abstract
1. Introduction
2. Monte Carlo Calculation of Pi
3. Experimental Results
3.1 Advantage Interval
3.2 Available Interval
3.3 Disadvantage Interval
4. Conclusions
References
1. Introduction
2. Monte Carlo Calculation of Pi
3. Experimental Results
3.1 Advantage Interval
3.2 Available Interval
3.3 Disadvantage Interval
4. Conclusions
References
저자정보
참고문헌
자료제공 : 네이버학술정보