incubator-hama-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Apache Wiki <wikidi...@apache.org>
Subject [Hama Wiki] Trivial Update of "Hamburg" by udanax
Date Mon, 20 Jul 2009 09:26:25 GMT
Dear Wiki user,

You have subscribed to a wiki page or wiki category on "Hama Wiki" for change notification.

The following page has been changed by udanax:
http://wiki.apache.org/hama/Hamburg

------------------------------------------------------------------------------
  = Rationale =
  == Motivation ==
- The MapReduce (M/R) programming model is inappropriate to problems based on data where each
portion depends on many other potions and their relations are very complicated. It is because
these problems cause as follows:
+ The !MapReduce (M/R) programming model is inappropriate to problems based on data where
each portion depends on many other potions and their relations are very complicated. It is
because these problems cause as follows:
   * limit to assigning one reducer
    * In case that the relations of data are very complex, assigning intermediate data to
appropriate reducers by considering their dependency of partitioned graphs may be very hard.
Assigning only one reducer is a straightway to solve complexity dependency, but it is apparent
to cause deterioration of scalability.
   * many M/R iterations
@@ -36, +36 @@

  
  [http://lh5.ggpht.com/_DBxyBGtfa3g/SmQTwhOSGwI/AAAAAAAABmY/ERiJ2BUFxI0/s800/figure2.PNG]
  
- The graph was stored in Hbase on distributed system as above. The root is 1. Then, we need
only one 'Bulk synchronization' between server2 and server3 with Hamburg. Rests will be calculated
on local machine.
+ The root node is 1. Then, we need only one 'Bulk synchronization' between server2 and server3
with Hamburg. Rests will be calculated on local machine.
  
  [http://lh6.ggpht.com/_DBxyBGtfa3g/SmQTwvxT2zI/AAAAAAAABmc/BRrv7plzPtc/s800/figure3.PNG]
  

Mime
View raw message