CSE 552 Fall 2013 Course Calendar

CSE 552 Fall 2013
Course Calendar

Subscribe to this calendar (google, iCal, etc.)

September

Monday Tuesday Wednesday Thursday Friday

23
Background reading
Birrell and Nelson, Implementing Remote Procedure Calls
Google, Introduction to Distributed System Design
Lamport, Time, Clocks and the Ordering of Events (up to, not including, the section on physical clocks)
Bernstein, Hadzilacos, and Goodman, Distributed Recovery (up to, and not including, three phase commit)
Dean and Ghemawat, MapReduce: Simplified Data Processing on Large Clusters
Mockapetris, Development of the Domain Name System
24 25
10:30-11:50 Lecture
SAV 131
Introduction: SaaS/SOA/WSDL/SOAP/AJAX/REST
1. Yegge, Lessons for Google from Amazon's Service Oriented Architecture
26 27

30
10:30-11:50 Lecture
SAV 131
Programming frameworks (1)
Hank to lead discussion
1. Jul et al., Fine-Grained Mobility in the Emerald System
2. Liskov, Distributed Programming in Argus
Optional: Liu et al., Fabric: A Platform for Secure Distributed Computation and Storage
Optional: Birell et al., Network Objects
01 02
10:30-11:50 Lecture
SAV 131
Programming frameworks (2) and Coral
1. Adya et al., Thialfi: A Client Notification Service for Internet Scale Applications
2. Freedman, Experiences with CoralCDN
Optional. Eugster et al., The Many Faces of Publish/Subscribe
03 04
17:00 Problem set 1

November

Monday Tuesday Wednesday Thursday Friday

04
NO CLASS
05 06
NO CLASS
07 08
10:30-11:50 Lecture
SAV 131
Storage and Lookup (2) (Location: Gates Commons)
1. Escriva et al., HyperDex: A Distributed, Searchable Key-Value Store

11
NO CLASS
12 13
10:30-11:50 Lecture
SAV 131
To SQL or not
1. DeWitt, Mapreduce is a major step backwards
2. Power and Li, Piccolo: Building Fast, Distributed Programs with Partitioned Tables
Optional: Gonzalez et al., PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs
Optional: Yu et al: DryadLINQ: A System for General-Purpose Distributed Data-Parallel Computing Using a High-Level Language
14 15
10:30-11:50 Lecture
SAV 131
Beyond the Data Center (1) (Location: Gates Commons)
1. DeCandia et al., Dynamo: Amazon's Highly Available Key-Value Store
Optional: Cooper et al., PNUTS: Yahoo!'s Hosted Data Serving Platform

17:00 Problem set 2

18
10:30-11:50 Lecture
SAV 131
Storage and Lookup (3)
Bill Bolosky and Jon Howell to lead discussion
1. Bolosky et al., The Farsite Project: A Retrospective
19 20
10:30-11:50 Lecture
SAV 131
Beyond the Data Center (2)
1. Glendenning et al., Scalable Consistency in Scatter
2. Corbett et al., Spanner: Google's Globally Distributed Database
Optional: Baker et al., Megastore: Providing Scalable, Highly Available Storage for Interactive Services
Optional: Calder et al., Windows Azure Storage: A Highly Available Cloud Storage Service with Strong Consistency
21 22
17:00 Five page project writeup

25
10:30-11:50 Lecture
SAV 131
Weakly Connected Systems
1. Terry et al., Managing Update Conflicts in Bayou, a Weakly Connected Replicated Storage System
2. Linus Torvalds on git
Optional: Petersen et al., Flexible Update Propagation for Weakly Consistent Replication
Optional: Garcia-Molina, Ullman, Widom, 18.1-18.3, 18.8-18.9 (database consistency levels)
26 27
10:30-11:50 Lecture
SAV 131
Resource Allocation
1. Fu et al., SHARP: An Architecture for Secure Resource Peering
2. Hindman et al., Mesos: A Platform for Fine-Grained Resource Sharing in the Data Center
Optional: Popa et al., FairCloud: Sharing the Network in Cloud Computing
28 29

December

Monday Tuesday Wednesday Thursday Friday

02
10:30-11:50 Lecture
SAV 131
Authentication
1. Burrows, Abadi, and Needham, A Logic of Authentication
Optional: Steiner et al., Kerberos: An Authentication Service for Open Network Systems
03 04
10:30-11:50 Lecture
SAV 131
Security
1. Lampson, Practical Principles for Computer Security
Optional: Lampson et al., Authentication in Distributed Systems: Theory and Practice
05 06

09
Oral Final Exam (CSE 674)
10
12:00 Final project report
11
Final project presentation (CSE 678)
12 13

September
Monday	Tuesday	Wednesday	Thursday	Friday
23 Background reading Birrell and Nelson, Implementing Remote Procedure Calls Google, Introduction to Distributed System Design Lamport, Time, Clocks and the Ordering of Events (up to, not including, the section on physical clocks) Bernstein, Hadzilacos, and Goodman, Distributed Recovery (up to, and not including, three phase commit) Dean and Ghemawat, MapReduce: Simplified Data Processing on Large Clusters Mockapetris, Development of the Domain Name System	24	25 10:30-11:50 Lecture SAV 131 Introduction: SaaS/SOA/WSDL/SOAP/AJAX/REST 1. Yegge, Lessons for Google from Amazon's Service Oriented Architecture	26	27
30 10:30-11:50 Lecture SAV 131 Programming frameworks (1) Hank to lead discussion 1. Jul et al., Fine-Grained Mobility in the Emerald System 2. Liskov, Distributed Programming in Argus Optional: Liu et al., Fabric: A Platform for Secure Distributed Computation and Storage Optional: Birell et al., Network Objects	01	02 10:30-11:50 Lecture SAV 131 Programming frameworks (2) and Coral 1. Adya et al., Thialfi: A Client Notification Service for Internet Scale Applications 2. Freedman, Experiences with CoralCDN Optional. Eugster et al., The Many Faces of Publish/Subscribe	03	04 17:00 Problem set 1

October
Monday	Tuesday	Wednesday	Thursday	Friday
07 10:30-11:50 Lecture SAV 131 Cache Coherence (1) Mike Dahlin to lead discussion 1. Ousterhout, The Role of Distributed State 2. Anderson et al., Serverless Network File Systems Optional: The Google File System	08	09 10:30-11:50 Lecture SAV 131 Cache Coherence (2) 1. Nishtala et al., Scaling Memcache at Facebook 2. Ports et al., Transactional Consistency and Automatic Management in an Application Data Cache	10	11 17:00 One page project summary
14 10:30-11:50 Lecture SAV 131 Distributed vs. Global State 1. Chandy and Lamport, Distributed Snapshots: Determining Global States of Distributed Systems Optional: Fagin et al., Common Knowledge Revisited Optional: Schneider, Implementing Fault-Tolerant Services Using the State Machine Approach: A Tutorial	15	16 10:30-11:50 Lecture SAV 131 Paxos 1. Lamport, Paxos Made Simple	17	18
21 NO CLASS	22	23 10:30-11:50 Lecture SAV 131 Paxos Implemented 1. Liskov and Cowling, Viewstamped Replication Revisited 2. Bolosky et al., Paxos Replicated State Machines as a Basis of a High-Performance Data Store Optional: van Renesse, Paxos Made Moderately Complex Optional: Mazieres, Paxos Made Practical Optional: Chandra et al., Paxos Made Live: An Engineering Perspective	24	25 10:30-11:50 Lecture SAV 131 Byzantine Fault Tolerance (Location: SAV 260) 1: Liskov, From Viewstamped Replication to Byzantine Fault Tolerance (Section 7.6 - 7.8 only) Optional: Castro and Liskov, Practical Byzantine Fault Tolerance Optional: Clement et al., UpRight Cluster Services Optional: OceanStore: An Architecture for Global-Scale Persistent Storage Optional: Kotla et al., Zyzzyva: Speculative Byzantine Fault Tolerance
28 10:30-11:50 Lecture SAV 131 Serializability 1. Brewer, CAP Twelve Years Later: How the Rules Have Changed 2. Gun Sirer, Consistency Alphabet Soup 3. Gun Sirer, Broken By Design: MongoDB Fault Tolerance Optional: Belaramani et al., PRACTI Replication	29	30 10:30-11:50 Lecture SAV 131 Storage and Lookup (1) 1. Schroeder, Birrell, Needham, Experience with Grapevine: The Growth of a Distributed System 2. Chang et al., Bigtable: A Distributed Storage System for Structured Data	31	01 17:00 Three page project outline

November
Monday	Tuesday	Wednesday	Thursday	Friday
04 NO CLASS	05	06 NO CLASS	07	08 10:30-11:50 Lecture SAV 131 Storage and Lookup (2) (Location: Gates Commons) 1. Escriva et al., HyperDex: A Distributed, Searchable Key-Value Store
11 NO CLASS	12	13 10:30-11:50 Lecture SAV 131 To SQL or not 1. DeWitt, Mapreduce is a major step backwards 2. Power and Li, Piccolo: Building Fast, Distributed Programs with Partitioned Tables Optional: Gonzalez et al., PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs Optional: Yu et al: DryadLINQ: A System for General-Purpose Distributed Data-Parallel Computing Using a High-Level Language	14	15 10:30-11:50 Lecture SAV 131 Beyond the Data Center (1) (Location: Gates Commons) 1. DeCandia et al., Dynamo: Amazon's Highly Available Key-Value Store Optional: Cooper et al., PNUTS: Yahoo!'s Hosted Data Serving Platform 17:00 Problem set 2
18 10:30-11:50 Lecture SAV 131 Storage and Lookup (3) Bill Bolosky and Jon Howell to lead discussion 1. Bolosky et al., The Farsite Project: A Retrospective	19	20 10:30-11:50 Lecture SAV 131 Beyond the Data Center (2) 1. Glendenning et al., Scalable Consistency in Scatter 2. Corbett et al., Spanner: Google's Globally Distributed Database Optional: Baker et al., Megastore: Providing Scalable, Highly Available Storage for Interactive Services Optional: Calder et al., Windows Azure Storage: A Highly Available Cloud Storage Service with Strong Consistency	21	22 17:00 Five page project writeup
25 10:30-11:50 Lecture SAV 131 Weakly Connected Systems 1. Terry et al., Managing Update Conflicts in Bayou, a Weakly Connected Replicated Storage System 2. Linus Torvalds on git Optional: Petersen et al., Flexible Update Propagation for Weakly Consistent Replication Optional: Garcia-Molina, Ullman, Widom, 18.1-18.3, 18.8-18.9 (database consistency levels)	26	27 10:30-11:50 Lecture SAV 131 Resource Allocation 1. Fu et al., SHARP: An Architecture for Secure Resource Peering 2. Hindman et al., Mesos: A Platform for Fine-Grained Resource Sharing in the Data Center Optional: Popa et al., FairCloud: Sharing the Network in Cloud Computing	28	29

December
Monday	Tuesday	Wednesday	Thursday	Friday
02 10:30-11:50 Lecture SAV 131 Authentication 1. Burrows, Abadi, and Needham, A Logic of Authentication Optional: Steiner et al., Kerberos: An Authentication Service for Open Network Systems	03	04 10:30-11:50 Lecture SAV 131 Security 1. Lampson, Practical Principles for Computer Security Optional: Lampson et al., Authentication in Distributed Systems: Theory and Practice	05	06
09 Oral Final Exam (CSE 674)	10 12:00 Final project report	11 Final project presentation (CSE 678)	12	13