Author: edwardyoon
Date: Thu Feb 28 01:44:39 2013
New Revision: 1451073
URL: http://svn.apache.org/r1451073
Log:
Move all credits into 'Who we are' page
Modified:
hama/site/trunk/webbook/index.html
Modified: hama/site/trunk/webbook/index.html
URL:
http://svn.apache.org/viewvc/hama/site/trunk/webbook/index.html?rev=1451073&r1=1451072&r2=1451073&view=diff
==============================================================================
--- hama/site/trunk/webbook/index.html (original)
+++ hama/site/trunk/webbook/index.html Thu Feb 28 01:44:39 2013
@@ -16,7 +16,7 @@
Apache Hama leverages BSP computing techniques to speed up iteration loops
during the iterative process that requires several passes of messages before
the final processed output is available. It provides an easy and flexible
programming model, as compared with traditional models of Message Passing.It is
compatible with any distributed storage, so you can use the Hama BSP on your
existing Hadoop clusters. Finding shortest paths, K-Means clustering, ..., etc.
are some of the problems tackled by Hama today.
<br/><br/>
-This WebBook is written by <a href="http://hama.apache.org/team-list.html";>The
Apache Hama Team</a> and illustrated by Arthur, Edward J. Yoon, and Jooyoun
Kang.
+This WebBook is written by <a href="http://hama.apache.org/team-list.html";>The
Apache Hama Team</a>.
<br/><br/>
<div align="center"><h2>Table of Contents</h2></div>
@@ -37,66 +37,6 @@ This WebBook is written by <a href="http
<li>Appendix 2. Running Hama on Clouds</li>
</ul>
</li>
-<li>Upgrade and Migration
- <ul>
- <li>Migration to Hama 0.6.x</li>
- </ul>
-</li>
-<li>Hama BSP Programming Model
- <ul>
- <li>Understanding of Bulk Synchronous Parallel Model
- <ul>
- <li>Pre-Processing step</li>
- <li>Computation Superstep</li>
- <li>Communication</li>
- <li>Synchronization</li>
- </ul>
- </li>
- <li>Hama BSP Interface
- <ul>
- <li>Input and Output</li>
- <li>Communication Model</li>
- <li>Synchronization</li>
- <li>Counters</li>
- <li>Setup and Cleanup</li>
- <li>Combiners</li>
- </ul>
- </li>
- </ul>
-
- <li>Hama Graph Computing Framework
- <ul><li>Introduction</li>
- <li>Graph Programming Model</li>
- <li>Combiners</li>
- <li>Aggregator</li>
- <li>GraphJob Submission</li>
- <li>Graph Computing Turorials</li>
- <li>Additional Functionality<ul><li>Graph Repair</li><li>Self Referencing
Vertex</li></ul></li>
- </ul>
- </li>
-
- <li>Machine Learning Library
- <ul><li>Why Machine Learning with BSP?</li>
- <li>K-Means Clustering</li>
- <li>Gradient Descent</li>
- <li>Math</li></ul>
- </li>
-
- <li>Hama Streaming and Pipes</li>
-
- <li>Architecture
- <ul>
- <li>Major Components<ul>
- <li>BSPMaster</li>
- <li>GroomServer</li>
- <li>Zookeeper</li></ul>
- <li>BSP Task Execution<ul><li>Job Submission</li><li>Job and Task
Scheduling</li><li>Task Execution Lifecycle</li></ul>
- <li>Synchronization
- <li>Fault Tolerance</li>
- </ul>
- </li>
-
- <li>Apache Hama Case Studies</li>
</ul>
