BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Very Large Scale Graph Processing
DTSTART:20160608T143000
DTEND:20160608T163000
DTSTAMP:20260427T223656Z
UID:d8781920e886204574cbbad6bb1c31c40c1e1de2fe3aabf2a97dfd22
CATEGORIES:Conferences - Seminars
DESCRIPTION:Laurent Bindschaedler\nEDIC Candidacy Exam:\nExam President: P
 rof. Edouard Bugnion\nThesis Director: Prof. Willy Zwaenepoel\nCo-examiner
 : Prof. Christos Kozyrakis\nBackground papers:Pregel: A System for large-s
 cale Graph ProcessingPowergraph: Distributed Graph-parallel Computation on
 \nNatural GraphsGraphchi: Large-scale Graph Computation on just a PC.Abstr
 act\nAnalytics over large graphs is an important and challenging problem d
 ue to the large scale and structure of many graphs. Current approaches to 
 tackle this problem either scale out to multiple machines or scale up on a
  single machine using external memory. We survey existing systems exemplif
 ying these trends. Pregel introduces a general-purpose abstraction based o
 n local vertex computation. PowerGraph refines the computation model to re
 duce overhead and load imbalance. GraphChi rearranges graph structure to p
 rocess them efficiently out-of-core. Finally\, we investigate a third desi
 gn direction: scaling out graph computation using secondary storage. We pr
 esent Chaos and demonstrate its scalability by processing a graph input of
  250 terabytes on 20 commodity servers and provide directions for future r
 esearch.
LOCATION:BC 129 https://plan.epfl.ch/?room==BC%20129
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR