{Sequential Code} {Sequential Code} {Sequential Code} - - PowerPoint PPT Presentation

▶
sequential
SMART_READER_LITE
LIVE PREVIEW

{Sequential Code} {Sequential Code} {Sequential Code} - - PowerPoint PPT Presentation

Nov 06, 2022 45 likes •376 views

{Sequential Code} {Sequential Code} {Sequential Code} {Sequential Code} {Sequential Code} {MapReduce Code} for (int i=0; i < $in.size(); ++i) { if ($in.get(i) > $c) $out.add($in.get(i)); } for (int i=0; i <

slide-1
SLIDE 1
slide-2
SLIDE 2
slide-3
SLIDE 3

{Sequential Code}

slide-4
SLIDE 4

{Sequential Code}

slide-5
SLIDE 5

{Sequential Code}

slide-6
SLIDE 6

{Sequential Code}

slide-7
SLIDE 7

{Sequential Code} {MapReduce Code}

slide-8
SLIDE 8
slide-9
SLIDE 9
slide-10
SLIDE 10
slide-11
SLIDE 11

for (int i=0; i < $in.size(); ++i) { if ($in.get(i) > $c) $out.add($in.get(i)); }

slide-12
SLIDE 12

for (int i=0; i < $in.size(); ++i) { if ($in.get(i) > $c) $out.add($in.get(i)); }

  • $out.union($in.filter(e -> e > $c));
slide-13
SLIDE 13
  • for (int i=0; i<N; i++) {

HashMap<String,Double> contrib = new HashMap<>(); for (Map.Entry<String,Double> r : ranks.entrySet()) { List<String> urls = grouped_links.get(r.getKey()); if(urls != null) { int size = urls.size(); urls.forEach(dst -> { if (!contrib.containsKey(dst)) contrib.put(dst, 0.0); contrib.put(dst, contrib.get(dst) + (r.getValue() / size)); });}} for (String dst : contrib.keySet()) ranks.put(dst, contrib.get(dst) * 0.85 + 0.15); }

slide-14
SLIDE 14
  • for (int i=0; i<N; i++) {

HashMap<String,Double> contrib = new HashMap<>(); for (Map.Entry<String,Double> r : ranks.entrySet()) { List<String> urls = grouped_links.get(r.getKey()); if(urls != null) { int size = urls.size(); urls.forEach(dst -> { if (!contrib.containsKey(dst)) contrib.put(dst, 0.0); contrib.put(dst, contrib.get(dst) + (r.getValue() / size)); });}} for (String dst : contrib.keySet()) ranks.put(dst, contrib.get(dst) * 0.85 + 0.15); }

slide-15
SLIDE 15

int sum = 0; for (Integer val : data) { sum += val * val; } int sum = 0; sum = data.map(val -> val*val) .reduce((v1,v2) -> v1+v2);

slide-16
SLIDE 16

λ𝑛 𝑤 → 𝑤 ∗ 𝑤 𝜇𝑠 𝑤1, 𝑤2 → 𝑤1 + 𝑤2 𝑡𝑣𝑛 = 𝑠𝑓𝑒𝑣𝑑𝑓(𝑛𝑏𝑞(𝑒𝑏𝑢𝑏, 𝜇𝑛), 𝜇𝑠); int sum = 0; for (Integer val : data) { sum += val * val; } int sum = 0; sum = data.map(val -> val*val) .reduce((v1,v2) -> v1+v2);

slide-17
SLIDE 17

λ𝑛 𝑤 → 𝑤 ∗ 𝑤 𝜇𝑠 𝑤1, 𝑤2 → 𝑤1 + 𝑤2 𝑡𝑣𝑛 = 𝑠𝑓𝑒𝑣𝑑𝑓(𝑛𝑏𝑞(𝑒𝑏𝑢𝑏, 𝜇𝑛), 𝜇𝑠); int sum = 0; for (Integer val : data) { sum += val * val; } int sum = 0; sum = data.map(val -> val*val) .reduce((v1,v2) -> v1+v2);

slide-18
SLIDE 18

λ𝑛 𝑤 → 𝑤 ∗ 𝑤 𝜇𝑠 𝑤1, 𝑤2 → 𝑤1 + 𝑤2 𝑡𝑣𝑛 = 𝑠𝑓𝑒𝑣𝑑𝑓(𝑛𝑏𝑞(𝑒𝑏𝑢𝑏, 𝜇𝑛), 𝜇𝑠); int sum = 0; for (Integer val : data) { sum += val * val; } int sum = 0; sum = data.map(val -> val*val) .reduce((v1,v2) -> v1+v2);

slide-19
SLIDE 19

for (int i=0; i<N; i++) { HashMap<String,Double> contrib = new HashMap<>(); for (Map.Entry<String,Double> r : ranks.entrySet()) { List<String> urls = grouped_links.get(r.getKey()); if(urls != null) { int size = urls.size(); urls.forEach(dst -> { if (!contrib.containsKey(dst)) contrib.put(dst, 0.0); contrib.put(dst, contrib.get(dst) + (r.getValue() / size)); });}} for (String dst : contrib.keySet()) ranks.put(dst, contrib.get(dst) * 0.85 + 0.15); }

slide-20
SLIDE 20

for (int i=0; i<N; i++) { HashMap<String,Double> contrib = new HashMap<>(); for (Map.Entry<String,Double> r : ranks.entrySet()) { List<String> urls = grouped_links.get(r.getKey()); if(urls != null) { int size = urls.size(); urls.forEach(dst -> { if (!contrib.containsKey(dst)) contrib.put(dst, 0.0); contrib.put(dst, contrib.get(dst) + (r.getValue() / size)); });}} for (String dst : contrib.keySet()) ranks.put(dst, contrib.get(dst) * 0.85 + 0.15); }

slide-21
SLIDE 21

for (int i=0; i<N; i++) { HashMap<String,Double> contrib = new HashMap<>(); for (Map.Entry<String,Double> r : ranks.entrySet()) { List<String> urls = grouped_links.get(r.getKey()); if(urls != null) { int size = urls.size(); urls.forEach(dst -> { if (!contrib.containsKey(dst)) contrib.put(dst, 0.0); contrib.put(dst, contrib.get(dst) + (r.getValue() / size)); });}} for (String dst : contrib.keySet()) ranks.put(dst, contrib.get(dst) * 0.85 + 0.15); }

slide-22
SLIDE 22

for (int i=0; i<N; i++) { HashMap<String,Double> contrib = new HashMap<>(); for (Map.Entry<String,Double> r : ranks.entrySet()) { List<String> urls = grouped_links.get(r.getKey()); if(urls != null) { int size = urls.size(); urls.forEach(dst -> { if (!contrib.containsKey(dst)) contrib.put(dst, 0.0); contrib.put(dst, contrib.get(dst) + (r.getValue() / size)); });}} for (String dst : contrib.keySet()) ranks.put(dst, contrib.get(dst) * 0.85 + 0.15); }

slide-23
SLIDE 23

for (int i=0; i<N; i++) { HashMap<String,Double> contrib = new HashMap<>(); for (Map.Entry<String,Double> r : ranks.entrySet()) { List<String> urls = grouped_links.get(r.getKey()); if(urls != null) { int size = urls.size(); urls.forEach(dst -> { if (!contrib.containsKey(dst)) contrib.put(dst, 0.0); contrib.put(dst, contrib.get(dst) + (r.getValue() / size)); });}} for (String dst : contrib.keySet()) ranks.put(dst, contrib.get(dst) * 0.85 + 0.15); }

≡

slide-24
SLIDE 24
slide-25
SLIDE 25
slide-26
SLIDE 26
slide-27
SLIDE 27
slide-28
SLIDE 28
slide-29
SLIDE 29
slide-30
SLIDE 30
slide-31
SLIDE 31
slide-32
SLIDE 32
slide-33
SLIDE 33