• Tue, Thu 13:00-14:15 (EB2 311)


  • Distributed Systems: Principles and Paradigms,
    Andrew S. Tanenbaum and Maarten van Steen, Pearson International (Prentice Hall)
  • Distributed Algorithms: An Intuitive Approach
    Wan Fokkink, MIT Press
  • Distributed Computing: Fundamentals, Simulations, and Adv. Topics
    H. Attiya and J. Welch, Wiley


  • Midterm and Final exams - 30% / 30%
  • Project - 20%
  • Classroom participation - 20%
* Subject to change


Lecture Slides

Reading List

  • Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications, Stoica et al., SIGCOMM 2001 [PDF]
  • A Scalable Content-Addressable Network, Ratnasamy et al., SIGCOMM 2001 [PDF]
  • The Google File System, Ghemawat et al., SOSP 2003 [PDF]
  • MapReduce: Simplified Data Processing on Large Clusters, Dean et al., OSDI 2004 [PDF]
  • Querying very large multi-dimensional datasets in ADR, Kurc et al., SC 1999 [PDF]
  • SkewTune: mitigating skew in mapreduce applications, Kwon et al., SIGMOD 2012. [PDF]
  • Balancing reducer skew in MapReduce workloads using progressive sampling, Ramakrishnan et al., SOCC 2012. [PDF]
  • M3R: Increased performance for in-memory Hadoop jobs, Shinnar et al., VLDB 2012 [PDF]
  • ReStore: Reusing results of MapReduce jobs, Elghandour et al., VLDB 2012 [PDF]


Link :